Maximal cocliques in the Kneser graph on plane-solid flags in PG(6,q)
DOI10.2140/IIG.2020.18.39zbMATH Open1465.05089arXiv1904.08656OpenAlexW3106969478MaRDI QIDQ2040375FDOQ2040375
Authors: Klaus Metsch, Daniel Werner
Publication date: 13 July 2021
Published in: Innovations in Incidence Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.08656
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Cites Work
Cited In (7)
- Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, q)\)
- The unique coclique extension property for apartments of buildings
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
- On the chromatic number of some generalized Kneser graphs
- Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
- On the chromatic number of two generalized Kneser graphs
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)