Perfect 2-colorings of the Grassmann graph of planes (Q2290347): Difference between revisions

Summary: We construct an infinite family of intriguing sets, or equivalently perfect 2-colorings, that are not tight in the Grassmann graph of planes of \(\mathrm{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\).