Anastos–Fabian–Müyesser–Szabó conjecture for three disjoint perfect matchings
Anastos–Fabian–Müyesser–Szabó conjecture for three disjoint perfect matchings
Let be a graph on vertices that is the union of three disjoint perfect matchings. An -matching is a matching containing exactly edges from the th perfect matching. Suppose that has a component that is not isomorphic to . Anastos–Fabian–Müyesser–Szabó conjecture. For any integers satisfying
contains an -matching. This removes the known obstruction formed by a disjoint union of copies of 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.