Perfect 2-colorings of the grassmann graph of planes

Authors

Stefaan DeWinter, Michigan Technological UniversityFollow
Klaus Metsch, Universitätsklinikum Gießen und Marburg, Standort Gießen

Document Type

Article

Publication Date

1-1-2020

Department

Department of Mathematical Sciences

Abstract

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.

Publisher's Statement

© The authors. Released under the CC BY-ND license (International 4.0). Publisher’s version of record: https://doi.org/10.37236/8672

Publication Title

Electronic Journal of Combinatorics

Recommended Citation

DeWinter, S., & Metsch, K. (2020). Perfect 2-colorings of the grassmann graph of planes. Electronic Journal of Combinatorics, 27(1), 1-19. http://doi.org/10.37236/8672
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.

Version

Publisher's PDF