Seymour's second neighbourhood conjecture: random graphs and reductions
A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short note we show that, for any fixed p∈[0,1/2)\ pın łeft[0,1/2\right) \, a.a.s. every orientation of G(n,p)\ Głeft(n,p\righ...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
January 2025
|
| In: |
Random structures & algorithms
Year: 2025, Volume: 66, Issue: 1, Pages: 1-12 |
| ISSN: | 1098-2418 |
| DOI: | 10.1002/rsa.21251 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1002/rsa.21251 Verlag, lizenzpflichtig, Volltext: https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.21251 
|
| Author Notes: | Alberto Espuny Díaz, António Girão, Bertille Granet, Gal Kronenberg |
| Summary: | A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short note we show that, for any fixed p∈[0,1/2)\ pın łeft[0,1/2\right) \, a.a.s. every orientation of G(n,p)\ Głeft(n,p\right) \ satisfies Seymour's conjecture (as well as a related conjecture of Sullivan). This improves on a recent result of Botler, Moura and Naia. Moreover, we show that p=1/2\ p=1/2 \ is a natural barrier for this problem, in the following sense: for any fixed p∈(1/2,1)\ pın łeft(1/2,1\right) \, Seymour's conjecture is actually equivalent to saying that, with probability bounded away from 0, every orientation of G(n,p)\ Głeft(n,p\right) \ satisfies Seymour's conjecture. This provides a first reduction of the problem. For a second reduction, we consider minimum degrees and show that, if Seymour's conjecture is false, then there must exist arbitrarily large strongly-connected counterexamples with bounded minimum outdegree. Contrasting this, we show that vertex-minimal counterexamples must have large minimum outdegree. |
|---|---|
| Item Description: | Erstveröffentlichung: 7. August 2024 Gesehen am 31.03.2025 |
| Physical Description: | Online Resource |
| ISSN: | 1098-2418 |
| DOI: | 10.1002/rsa.21251 |