Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\)
From MaRDI portal
Publication:2040375
DOI10.2140/iig.2020.18.39zbMath1465.05089arXiv1904.08656OpenAlexW3106969478MaRDI QIDQ2040375
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
Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial structures in finite projective spaces (51E20)
Related Items (4)
An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings ⋮ The unique coclique extension property for apartments of buildings ⋮ On the chromatic number of some generalized Kneser graphs ⋮ On the chromatic number of two generalized Kneser graphs
Cites Work
This page was built for publication: Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\)
