ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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,a3∈N0a_1,a_2,a_3\in\mathbb{N}_0 satisfying

a1+a2+a3=n−1,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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.