Glock–Kühn–Lo–Osthus high-girth Steiner system conjecture

From papers

For integers q>r2q>r\ge2, an (n,q,r)(n,q,r)-Steiner system is a collection of qq-element subsets of an nn-element set in which every rr-element subset lies in exactly one block. A (j,i)(j,i)-configuration is a set of ii blocks spanning at most jj vertices; nn is admissible when

(qiri)(niri)\binom{q-i}{r-i}\mid\binom{n-i}{r-i}

for all 0ir10\le i\le r-1. Glock–Kühn–Lo–Osthus's conjecture. For all integers q>r2q>r\ge2 and every integer g2g\ge2, there exists n0n_0 such that for all admissible nn0n\ge n_0, there exists an (n,q,r)(n,q,r)-Steiner system with no (i(qr)+r,i)(i(q-r)+r,i)-configurations for all 2ig2\le i\le g. 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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Michelle Delcourt and Luke Postle, “Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings”, arXiv:2204.08981 (2024).

Solutions 0

No solutions have been posted yet.