Perfect 2-colorings of the Grassmann graph of planes (Q2290347): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:55, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect 2-colorings of the Grassmann graph of planes |
scientific article |
Statements
Perfect 2-colorings of the Grassmann graph of planes (English)
0 references
27 January 2020
0 references
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\).
0 references
intriguing sets
0 references
Grassmann graph
0 references
