Anastos–Fabian–Müyesser–Szabó conjecture for three disjoint perfect matchings

Let GG be a graph on 2n2n vertices that is the union of three disjoint perfect matchings. An (a1,a2,a3)(a_1,a_2,a_3)-matching is a matching containing exactly aia_i edges from the iith perfect matching. Suppose that GG has a component that is not isomorphic to K4K_4. Anastos–Fabian–Müyesser–Szabó conjecture. For any integers a1,a2,a3N0a_1,a_2,a_3\in\mathbb{N}_0 satisfying

a1+a2+a3=n1,a_1+a_2+a_3=n-1,

GG contains an (a1,a2,a3)(a_1,a_2,a_3)-matching. This removes the known obstruction formed by a disjoint union of copies of K4K_4 and asks whether that is the only obstruction; the paper reiterates it as an open conjecture.

Sources & referencesView supporting material

Primary source

Simona Boyadzhiyska, Micha Christoph and Tibor Szabó, “Almost-perfect colorful matchings in three-edge-colored bipartite graphs”, arXiv:2504.15167 (2025).

Progress summary

Never refreshed

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.