Almost color-balanced perfect matching conjecture
Statement
Let and be positive integers, and let be an edge-coloring such that every color class has the same number of edges. A perfect matching of has color-deviation measure
Almost color-balanced perfect matching conjecture. There is a perfect matching of with
This conjecture asks for a perfect matching whose numbers of edges in the color classes are collectively within a bounded deviation of the color-balanced target in each class. The paper proves the weaker bound in general and proves the stronger bound when , while the stated bound remains unresolved.
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.