ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an edge-coloured connected graph, and let dGc(v)d^c_G(v) denote the number of distinct colours on edges incident to a vertex vv. Write

δc(G)=min⁡v∈V(G)dGc(v)\delta^c(G)=\min_{v\in V(G)}d^c_G(v)

for the minimum colour degree. A subgraph is properly coloured when consecutive edges have distinct colours. Li's conjecture. If δc(G)≥d\delta^c(G)\geq d, then GG contains a properly coloured Hamilton cycle or a properly coloured path of length ⌊3d/2⌋\lfloor 3d/2\rfloor.

This conjecture strengthens known lower bounds for properly coloured paths and cycles under a minimum colour-degree condition; the source gives no resolution, so its status remains 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 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.