Rainbow Hamiltonian cycle conjecture for graph families satisfying an Ore-type condition
Statement
Let with , and let be a family of -vertex graphs with the same vertex set; the graphs in the family may be identical. For a graph , let denote the minimum, over all nonadjacent vertex pairs , of . Rainbow Hamiltonian cycle conjecture. If for every , then contains a rainbow Hamiltonian cycle. This extends Ore's Hamiltonicity condition from a single graph to a family of graphs; the supplied text gives no resolution, so the conjecture is recorded as open.
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.