ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GcG^c be a 22-connected cc-edge-colored multigraph on nn vertices, where n≥10n\geq 10 and c≥3c\geq 3. Let rd(Gc)rd(G^c) denote its rainbow degree and let mm be its number of edges. Proper Hamiltonian cycle conjecture. If

rd(Gc)=crd(G^c)=c

and

m≥c(n−22)+4c+1,m\geq c\binom{n-2}{2}+4c+1,

then GcG^c has a proper Hamiltonian cycle. This conjecture proposes an edge-count condition, together with 2-connectivity and maximum rainbow degree, sufficient to guarantee a proper Hamiltonian cycle in an edge-colored multigraph.

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.