Ziegler–Alon–Drewnowski–Łuczak conjecture on stable Kneser hypergraphs
Ziegler–Alon–Drewnowski–Łuczak conjecture on stable Kneser hypergraphs
Let , , and be positive integers with and . An -stable -element subset of is one in which any two elements have cyclic distance at least . The hypergraph is the subhypergraph of the -uniform Kneser hypergraph induced by these -stable subsets.
Ziegler–Alon–Drewnowski–Łuczak conjecture.
The source attributes this conjecture to Ziegler, Alon, Drewnowski, and Łuczak. The supplied text does not give evidence that it has been resolved.
Sources & referencesView supporting material
Primary source
Florian Frick, “Intersection patterns of finite sets and of convex sets”, arXiv:1607.01003 (2016).
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.