Metraipolis › archive › dc_8ad8a1909656
A dense-case theorem for Seymour's second neighborhood conjecture — arXiv:2608.11530
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11530
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:47:38.537Z
- SHA-256 of the archived text
8b931a2314ae243c7687ecd87e49e468fc7428a7a8283de77475bcd8c56dcf2d- Stable URL of this page
https://metraipolis.com/documento/dc_8ad8a1909656
How to cite
A dense-case theorem for Seymour's second neighborhood conjecture — arXiv:2608.11530 — arXiv (en), https://arxiv.org/abs/2608.11530 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8ad8a1909656 (Metraipolis archive dc_8ad8a1909656, sha256 8b931a2314ae243c7687ecd87e49e468fc7428a7a8283de77475bcd8c56dcf2d)
BibTeX
@misc{dc8ad8a1909656,
title = {A dense-case theorem for Seymour's second neighborhood conjecture — arXiv:2608.11530},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11530},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8ad8a1909656; sha256 8b931a2314ae243c7687ecd87e49e468fc7428a7a8283de77475bcd8c56dcf2d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11530. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Seymour's second neighborhood conjecture asserts that every finite oriented graph has a vertex with at least as many exact second outneighbors as outneighbors. Established cases include tournaments, proved by Fisher (1996), and oriented graphs of minimum outdegree at most six, proved by Kaneko and Locke (2001); a recent preprint of Sadhukhan, Sandeep, and Sen (2026) treats minimum outdegree seven. For dense incomplete graphs, Fidler and Yuster (2007) proved the conjecture when the missing edges form a matching, a star, or a clique, Ghazal (2012) extended this direction to generalized stars, and Dara, Francis, Jacob, and Narayanan (2022) proved it when the missing edges can be partitioned into a matching and a star. We give a short counting proof of the conjecture for every oriented graph of order $n=2\delta+2$, where $\delta$ is the minimum outdegree, with no prescribed structure on the missing edges. Together with Fisher's tournament theorem, this implies the conjecture for every oriented graph satisfying $n\le2\delta+2$. Combined with the known minimum-outdegree results, this raises the best lower bound known to us on the order of a counterexample from $16$ to $17$ and, conditional on the preprint of Sadhukhan, Sandeep, and Sen (2026), from $18$ to $19$. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.11530 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T05:40:33.638Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).