Isometric embeddings of Johnson graphs in Grassmann graphs
Abstract
Let V be an n-dimensional vector space (4 n <∞) and let Gk(V) be the Grassmannian formed by all k-dimensional subspaces of V. The corresponding Grassmann graph will be denoted by k(V). We describe all isometric embeddings of Johnson graphs J(l,m), 1<m<l-1 in k(V), 1<k<n-1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J(n,k) in k(V) is an apartment of Gk(V) if and only if n=2k. Our second result (Theorem 5) is a classification of rigid isometric embeddings of Johnson graphs in k(V), 1<k<n-1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.