Seymour's second neighborhood conjecture for tournaments missing a generalized star
Combinatorics
2015-05-11 v3
Abstract
Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted version holds for tournaments missing a sun, star, or a complete graph.
Keywords
Cite
@article{arxiv.1106.0085,
title = {Seymour's second neighborhood conjecture for tournaments missing a generalized star},
author = {Salman Ghazal},
journal= {arXiv preprint arXiv:1106.0085},
year = {2015}
}
Comments
Accepted for publication in Journal of Graph Theory in 24 June 2011