Glock–Kühn–Lo–Osthus high-girth Steiner system conjecture
For integers , an -Steiner system is a collection of -element subsets of an -element set in which every -element subset lies in exactly one block. A -configuration is a set of blocks spanning at most vertices; is admissible when
for all . Glock–Kühn–Lo–Osthus's conjecture. For all integers and every integer , there exists such that for all admissible , there exists an -Steiner system with no -configurations for all . The text presents this as a common generalization of Erdős's conjecture and the Existence Conjecture; its resolution is not stated in the supplied passage.
References
Primary source
Michelle Delcourt and Luke Postle, “Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings”, arXiv:2204.08981 (2024).
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
No solutions have been posted yet.