Isometric embeddings of Johnson graphs in Grassmann graphs
Combinatorics
2010-09-15 v3
Abstract
Let be an -dimensional vector space () and let be the Grassmannian formed by all -dimensional subspaces of . The corresponding Grassmann graph will be denoted by . We describe all isometric embeddings of Johnson graphs , in , (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of in is an apartment of if and only if . Our second result (Theorem 5) is a classification of rigid isometric embeddings of Johnson graphs in , .
Cite
@article{arxiv.1003.3329,
title = {Isometric embeddings of Johnson graphs in Grassmann graphs},
author = {Mark Pankov},
journal= {arXiv preprint arXiv:1003.3329},
year = {2010}
}
Comments
New version -- 14 pages accepted to Journal of Algebraic Combinatorics