The three-colour exception conjecture for split matchings
Statement
Let be a graph on vertices whose edge set is decomposed into perfect matchings , , and , and let , , and be non-negative integers satisfying
A component of is assumed not to be isomorphic to . The three-colour exception conjecture. There exists a matching in such that
The preceding construction shows that disjoint unions of copies of can obstruct such a matching when all three multiplicities are odd. A positive answer would resolve the three-colour case of the question of Arman, Rödl, and Sales, and would in particular guarantee a matching whenever at least one of the is even, as well as whenever is odd. The conjecture is open in the source.
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.