The finite asymptotic separation index matching conjecture
Let be a locally finite Borel graph with a Borel bipartition . The bipartition has combinatorial expansion if there is a constant such that for every finite set . The asymptotic separation index of , denoted , is a value in . A Borel matching covering is a Borel matching whose every vertex in is incident to an edge of the matching.
Finite asymptotic separation index matching conjecture. If the bipartition has combinatorial expansion and , then has a Borel matching covering .
The theorem in the paper proves this when the expansion factor is sufficiently large, and proves the stronger factor-independent bound for graphs with . The conjecture asks whether every expansion factor greater than suffices when the asymptotic separation index is finite.
References
- Anton Bernshteyn, Matt Bowen and Felix Weilacher, “Measurable matchings in unbalanced graphs”, arXiv:2606.11558 (2026).
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.