加载中…
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 -embeddings, i.e. embeddings preserving all distances not greater than , of dual polar graphs whose diameter is not less than 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本