Meunier's chromatic number conjecture for stable Kneser graphs
Meunier's chromatic number conjecture for stable Kneser graphs
Let be the induced subgraph of the Kneser graph on the -stable -subsets of , where a subset is -stable when for every pair of distinct elements . Meunier's conjecture. If are non-negative integers such that and , then
This generalizes the chromatic-number formula for Schrijver graphs, which are the case . The source presents the assertion as Meunier's conjecture; no resolution is given in the supplied text.
Sources & referencesView supporting material
Primary source
Hamid Reza Daneshpajouh and József Osztényi, “On the neighborhood complex of s-stable Kneser graphs”, arXiv:1904.08219 (2019).
Additional references
2 papers in this index state this conjecture (2016–2019). The statement above is taken from the most recent of them; the others are arXiv:1604.07023.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.