Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG(3, q)

DOI10.1002/JCD.21940MaRDI QIDQ6576930zbMATH OpenFDO

Authors Philipp Heering, Klaus Metsch

Publication date 23 July 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

chromatic numbermaximal independent set\(q\)-analog of generalized Kneser graphErdős-Ko-Rado problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Combinatorial structures in finite projective spaces (51E20) Extremal set theory (05D05)

Recommendations

• The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
• On the chromatic number of \(q\)-Kneser graphs
• On the chromatic number of some generalized Kneser graphs
• Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, q)\)

Cites work

• An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
• 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
• How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
• The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces

Cited in

(1)

• On the chromatic number of some generalized Kneser graphs

This page was built for publication: Maximal cocliques and the chromatic number of the Kneser graph on chambers of \(\mathrm{PG}(3, q)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576930)