Abstract
The second neighborhood conjecture of Seymour asserts that for any orientation G = (V, E), there exists a vertex v ∈ V so that |N +(v)| ≤|Ë/++(õ)|. The conjecture was resolved by Fisher for tournaments. In this article, we prove the second neighborhood conjecture for several additional classes of dense orientations. We also prove some approximation results, and reduce an asymptotic version of the conjecture to a finite case.
Original language | English |
---|---|
Pages (from-to) | 208-220 |
Number of pages | 13 |
Journal | Journal of Graph Theory |
Volume | 55 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2007 |
Keywords
- Orientation
- Second neighborhood
- Tournament
ASJC Scopus subject areas
- Geometry and Topology
- Discrete Mathematics and Combinatorics