Improved bounds on the chromatic numbers of the square of Kneser graphs
From MaRDI portal
Publication:393168
DOI10.1016/J.DISC.2013.10.008zbMath1278.05102arXiv1305.2567OpenAlexW2171569275MaRDI QIDQ393168
Publication date: 16 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.2567
Related Items (3)
Coloring of the square of Kneser graph \(K(2k+r,k)\) ⋮ A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
Cites Work
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
- Exponents of uniform \(L\)-systems
- Primes in the interval [2n,3n]
- Labelling Graphs with a Condition at Distance 2
- Intersection Properties of Systems of Finite Sets
- Newton's Identities Once Again!
This page was built for publication: Improved bounds on the chromatic numbers of the square of Kneser graphs
