Seymour's non-uniform Caccetta–Häggkvist conjecture
Seymour's non-uniform Caccetta–Häggkvist conjecture
Let be a simple digraph with no sink, meaning no vertex has outdegree zero. Define
Seymour's non-uniform Caccetta–Häggkvist conjecture. contains a directed cycle of length at most
When all outdegrees equal , this would imply the Caccetta–Häggkvist conjecture. The conjecture was disproved by Hompe, so it is refuted.
Sources & referencesView supporting material
Primary source
Katie Clinch, Jackson Goerner, Tony Huynh and Freddie Illingworth, “Notes on Aharoni's rainbow cycle conjecture”, arXiv:2211.07897 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.