A generalisation of Seymour's second neighbourhood conjecture
Combinatorics
2020-01-22 v1
Abstract
In this note we propose a generalisation of Seymour's Second Neighbourhood Conjecture to two directed graphs on a vertex set. We prove that this generalisation holds in the case of tournaments, and we show that a natural strengthening of this conjecture does not hold.
Keywords
Cite
@article{arxiv.2001.07242,
title = {A generalisation of Seymour's second neighbourhood conjecture},
author = {Jeck Lim},
journal= {arXiv preprint arXiv:2001.07242},
year = {2020}
}