English

Isometric embeddings of Johnson graphs in Grassmann graphs

Combinatorics 2010-09-15 v3

Abstract

Let VV be an nn-dimensional vector space (4n<4\le n <\infty) and let Gk(V){\mathcal G}_{k}(V) be the Grassmannian formed by all kk-dimensional subspaces of VV. The corresponding Grassmann graph will be denoted by Γk(V)\Gamma_{k}(V). We describe all isometric embeddings of Johnson graphs J(l,m)J(l,m), 1<m<l11<m<l-1 in Γk(V)\Gamma_{k}(V), 1<k<n11<k<n-1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J(n,k)J(n,k) in Γk(V)\Gamma_{k}(V) is an apartment of Gk(V){\mathcal G}_{k}(V) if and only if n=2kn=2k. Our second result (Theorem 5) is a classification of rigid isometric embeddings of Johnson graphs in Γk(V)\Gamma_{k}(V), 1<k<n11<k<n-1.

Keywords

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

R2 v1 2026-06-21T14:58:49.838Z