On the chromatic number of two generalized Kneser graphs

DOI10.1016/j.ejc.2021.103474zbMath1480.05054arXiv2005.05762OpenAlexW3211369894MaRDI QIDQ2066011

Jozefien D'haeseleer, Klaus Metsch, Daniel Werner

Publication date: 13 January 2022

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

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

zbMATH Keywords

Erdős-Ko-Rado setHilton-Milner type theorem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The unique coclique extension property for apartments of buildings ⋮ On the chromatic number of some generalized Kneser graphs

Cites Work

• Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
• Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\)
• A Hilton-Milner theorem for vector spaces
• The Erdős-Ko-Rado theorem for vector spaces
• Intersection theorems for systems of finite vector spaces
• Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\)
• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: On the chromatic number of two generalized Kneser graphs