A generalisation of Seymour's second neighbourhood conjecture

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.

References in corpus (1)

• On iterated image size for point-symmetric relations