ProbXiv
Explorersign in
Problem archiveProblem record

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

Added
Links

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.