Document Type


Publication Date



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.

Publisher's Statement

© The authors. Released under the CC BY-ND license (International 4.0). Publisher’s version of record:

Publication Title

Electronic Journal of Combinatorics

Creative Commons License

Creative Commons Attribution-No Derivative Works 4.0 International License
This work is licensed under a Creative Commons Attribution-No Derivative Works 4.0 International License.


Publisher's PDF

Included in

Mathematics Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.