ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an edge-colored graph on nn vertices. The total color degree of GG is

d^(G)=∑v∈V(G)d^(v),\hat d(G)=\sum_{v\in V(G)}\hat d(v),

where d^(v)\hat d(v) is the number of distinct colors on edges incident with vv. A rainbow matching is a matching whose edges have pairwise distinct colors. Total color degree conjecture. If

d^(G)≥2mn,\hat d(G)\geq 2mn,

then GG contains a rainbow matching of size mm. The conjecture proposes an average color-degree condition guaranteeing a rainbow matching; the source presents it as affirmative future work but does not give evidence that it has been resolved.

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.