The type (4,3)(4,3) finite asymptotic separation index matching conjecture

From papers

Let GG be a locally finite Borel graph with a bipartition (A,B)(A,B) of type (4,3)(4,3), meaning that vertices in AA have degree 44 and vertices in BB have degree 33. Let asi(G)\mathsf{asi}(G) denote the asymptotic separation index.

Type (4,3)(4,3) finite asymptotic separation index matching conjecture. If asi(G)<\mathsf{asi}(G)<\infty, then GG has a Borel matching covering AA.

This is an explicitly identified special case of the finite-asymptotic-separation-index matching conjecture, and the paper states that it is already open.

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

Anton Bernshteyn, Matt Bowen and Felix Weilacher, “Measurable matchings in unbalanced graphs”, arXiv:2606.11558 (2026).

Solutions 0

No solutions have been posted yet.