The repeated-label reduction and its sharp threshold
Statement
Conjecture 6.3. Caccetta-H¨ aggkvist Conjecture (general case) Notes: For a digraph H, take G = H, k = d n
δ+ H
e, and E1 = · · · = Ek = E(H). We must get a rainbow cycle because the sum of the outdegrees at each vertex is ≥ n. This corresponds to a dicycle of length at most d n
δ+ H
e in H, as desired.
Record
- Source
- Added
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.