Seymour's second-neighborhood conjecture from a different perspective
Combinatorics
2019-07-31 v1
Abstract
Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex such that the number of vertices of out-distance from is at least as large as the number of vertices of out-distance from it. We present alternative statements of the conjecture in the language of linear algebra.
Cite
@article{arxiv.1907.12614,
title = {Seymour's second-neighborhood conjecture from a different perspective},
author = {Farid Bouya and Bogdan Oporowski},
journal= {arXiv preprint arXiv:1907.12614},
year = {2019}
}
Comments
8 pages