Anastos–Fabian–Müyesser–Szabó conjecture for three disjoint perfect matchings
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.