ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GcG^c be a strongly edge-colored graph with nn 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 GcG^c with nn vertices and degree at least n+12\frac{n+1}{2} 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 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.