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

DOI10.1002/jcd.21940zbMath1543.05053MaRDI QIDQ6576930

Philipp Heering, Klaus Metsch

Publication date: 23 July 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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