Choice number of Kneser graphs

DOI10.1016/j.disc.2022.113097zbMath1495.05087arXiv2108.00502OpenAlexW4226199673MaRDI QIDQ2166315

Andrey B. Kupavskii, Vera Bulankina

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberprobabilistic methodKneser graphschoice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On random subgraphs of Kneser and Schrijver graphs
• Random Kneser graphs and hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• Chromatic number of random Kneser hypergraphs
• A combinatorical proof of Kneser's conjecture
• Edge-critical subgraphs of Schrijver graphs. II: The general case
• The Chromatic Number of Kneser Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Choice number of Kneser graphs