A characterization of the Grassmann graphs: one missing case
Abstract
We prove that the Grassmann graphs J2(2D+3,D), D≥ 3, are characterized by their intersection numbers, which settles one of the few remaining cases.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.