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\in \left[0,1/2\right) $$ , a.a.s. every orientation of G ( n ,...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2024
|