Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)

DOI10.1016/j.ejc.2013.06.005zbMath1292.05204OpenAlexW2050988358MaRDI QIDQ2509740

Andries E. Brouwer, Aart Blokhuis, Tamás Szőnyi

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.005

Mathematics Subject Classification ID

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 (5)

An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings ⋮ An EKR-theorem for finite buildings of type \(D_{\ell }\) ⋮ The unique coclique extension property for apartments of buildings ⋮ Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\) ⋮ On the chromatic number of two generalized Kneser graphs

Cites Work

• Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
• On the chromatic number of \(q\)-Kneser graphs
• A Hilton-Milner theorem for vector spaces
• The Erdős-Ko-Rado theorem for vector spaces

This page was built for publication: Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)