Perfect 2-colorings of the grassmann graph of planes

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

    Similar works