The total color degree conjecture for rainbow matchings
Statement
Let be an edge-colored graph on vertices. The total color degree of is
where is the number of distinct colors on edges incident with . A rainbow matching is a matching whose edges have pairwise distinct colors. Total color degree conjecture. If
then contains a rainbow matching of size . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.