Department of Mathematical Sciences
We construct an infinite family of intriguing sets, or equivalently perfect 2-colorings, 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.
Electronic Journal of Combinatorics
Perfect 2-colorings of the grassmann graph of planes.
Electronic Journal of Combinatorics,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/2034
Creative Commons License
This work is licensed under a Creative Commons Attribution-No Derivative Works 4.0 International License.