Perfect 2-Colorings of the Grassmann Graph of Planes
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\ge 5$ odd, and show that the members of the family are the smallest possible examples if $n\ge 9$ or $q\ge 25$.
2017 ◽
Vol 27
(05)
◽
pp. 477-493
◽
1987 ◽
Vol 62
(4)
◽
pp. 1356-1362
◽
2001 ◽
Vol 10
(01)
◽
pp. 97-107
◽
2020 ◽
Vol 29
(10)
◽
pp. 2042008
Keyword(s):
2002 ◽
Vol 11
(03)
◽
pp. 363-368
◽
1933 ◽
Vol 29
(2)
◽
pp. 212-230
◽
Keyword(s):
2019 ◽
Vol 28
(11)
◽
pp. 1940003
◽
Keyword(s):