The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces

DOI10.37236/10239zbMath1467.51006arXiv2102.06688OpenAlexW3182358330MaRDI QIDQ2039997

Klaus Metsch

Publication date: 6 July 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.06688

zbMATH Keywords

chromatic numberfinite generalized quadranglesgeneralized Kneser graphsfinite projective 3-spaces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Generalized quadrangles and generalized polygons in finite geometry (51E12) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• On the chromatic number of \(q\)-Kneser graphs
• Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\)
• Colouring lines in projective space
• How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
• Finite generalized quadrangles
• A Hilton-Milner theorem for vector spaces
• The Erdős-Ko-Rado theorem for vector spaces

This page was built for publication: The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces