Choice number of Kneser graphs
From MaRDI portal
Abstract: In this short note, we show that for any and the choice number of the Kneser graph is .
Recommendations
Cites work
- A combinatorical proof of Kneser's conjecture
- A short proof of Kneser's conjecture
- Chromatic number of random Kneser hypergraphs
- Edge-critical subgraphs of Schrijver graphs. II: The general case
- scientific article; zbMATH DE number 3672329 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- Kneser's conjecture, chromatic number, and homotopy
- On random subgraphs of Kneser and Schrijver graphs
- Random Kneser graphs and hypergraphs
- The Chromatic Number of Kneser Hypergraphs
Cited in
(5)- scientific article; zbMATH DE number 1241393 (Why is no real title available?)
- scientific article; zbMATH DE number 842014 (Why is no real title available?)
- Two questions on Kneser colorings
- Colouring complete multipartite and Kneser-type digraphs
- Colouring complete multipartite and Kneser-type digraphs (extended abstract)
This page was built for publication: Choice number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166315)