On embeddings of Grassmann graphs in polar Grassmann graphs

preprint2015arXivOpen access

Abstract

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider 33-embeddings, i.e. embeddings preserving all distances not greater than 33, of dual polar graphs whose diameter is not less than 33 in polar Grassmann graphs formed by non-maximal singular subspaces. Using the same arguments we show that every such an embedding can be reduced to an embedding in a Grassmann graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.