Rainbow Hamiltonian cycle conjecture for strongly edge-colored graphs
Statement
Let be a strongly edge-colored graph with vertices, where strongly edge-colored means that any two adjacent edges and any two edges joined by an edge have distinct colors. Its degree is the usual graph degree. Rainbow Hamiltonian cycle conjecture. Every strongly edge-colored graph with vertices and degree at least has a rainbow Hamiltonian cycle. This conjecture proposes a Dirac-type minimum-degree condition guaranteeing a rainbow Hamiltonian cycle in a strongly edge-colored graph; the source presents it as an open conjecture.
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.