Maximal cocliques in the Kneser graph on plane-solid flags in PG(6,q)
From MaRDI portal
Publication:2040375
Abstract: For we determine the independence number of the Kneser graph on plane-solid flags in . More precisely we describe all maximal independent sets of size at least and show that every other maximal example has cardinality at most a constant times .
Recommendations
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, q)\)
- Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- On the chromatic number of \(q\)-Kneser graphs
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
- Erdős-Ko-Rado sets of flags of finite sets
Cites work
Cited in
(8)- On the chromatic number of two generalized Kneser graphs
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
- Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
- Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- The unique coclique extension property for apartments of buildings
- On the chromatic number of some generalized Kneser graphs
- On the largest independent sets in the Kneser graph on chambers of \(\mathrm{PG}(4, \mathrm{q})\)
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, q)\)
This page was built for publication: Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040375)