On the chromatic number of some generalized Kneser graphs
From MaRDI portal
Publication:6187005
DOI10.1002/jcd.21875arXiv2205.02632MaRDI QIDQ6187005
Klaus Metsch, Jozefien D'haeseleer, Daniel Werner
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.02632
Cites Work
- Unnamed Item
- On the chromatic number of \(q\)-Kneser graphs
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\)
- A Hilton-Milner theorem for vector spaces
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\)
- On the chromatic number of two generalized Kneser graphs
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings