Intriguing sets in distance regular graphs
classification
🧮 math.CO
keywords
familyintriguingsetsconstructdistanceexamplesgraphgraphs
read the original abstract
We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG$(n,q)$, $n\ge 5$ odd, and show that the members of the family are the smallest possible examples if $n\ge 9$ or $q\ge 25$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.