ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and kk be positive integers, and let c:E(K2kn)→[k]c:E(K_{2kn})\to [k] be an edge-coloring such that every color class has the same number of edges. A perfect matching MM of K2knK_{2kn} has color-deviation measure

f(M)=∑i=1k∣∣c−1(i)∩M∣−n∣.f(M)=\sum\limits_{i=1}^k\Big||c^{-1}(i)\cap M|-n\Big|.

Almost color-balanced perfect matching conjecture. There is a perfect matching MM of K2knK_{2kn} with

f(M)≤O(k2).f(M)\leq O(k^2).

This conjecture asks for a perfect matching whose numbers of edges in the kk color classes are collectively within a bounded O(k2)O(k^2) deviation of the color-balanced target nn in each class. The paper proves the weaker bound f(M)≤3kknln⁡(2k)f(M)\leq 3k\sqrt{kn\ln(2k)} in general and proves the stronger bound f(M)≤2f(M)\leq 2 when k=3k=3, while the stated O(k2)O(k^2) 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 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.