Sullivan's second neighbourhood conjecture
Let be an oriented graph. For a vertex , let be its second out-neighbourhood and let be its in-neighbourhood.
Sullivan's conjecture. Every oriented graph contains at least one vertex such that
Sullivan proposed this variation of Seymour's conjecture in a survey on the Caccetta–Häggkvist conjecture. The paper constructs special putative counterexamples and studies highly symmetric cases, but the conjecture remains open.
References
3 papers in this index state this conjecture (2023–2026). The statement above is taken from the most recent of them; the others are arXiv:2403.02842, arXiv:2306.03493.
Source: Krystal Guo, Ross J. Kang and Gabriëlle Zwaneveld, “Seymour-tight orientations”, arXiv:2603.29626 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.