Intriguing sets in distance regular graphs
Abstract
We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG(n,q), n 5 odd, and show that the members of the family are the smallest possible examples if n 9 or q 25.
0
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.