ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cycle of length 2ℓ2\ell whose edges are colored with hh colors. Let M0M_0 and M1M_1 be the perfect matchings consisting of the even and odd edges, respectively, and let pM∈Z+hp_M\in\mathbb Z_+^h record the number of edges of each color in a matching MM. Let k∈Zhk\in\mathbb Z^h lie on the segment between pM0p_{M_0} and pM1p_{M_1}. The multicolored cycle matching conjecture. There is a matching MM of size at least ℓ−h+2\ell-h+2 such that

pM≤kp_M\leq k

component-wise and

∥pM−k∥1≤h−2.\lVert p_M-k\rVert_1\leq h-2.

The paper presents this as a generalization of the corresponding three-color result and as a possible ingredient for extending the approximation guarantee to graphs with a constant number h≥4h\geq4 of colors. Its resolution is not given in the supplied text.

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.