Squaring a tournament: A proof of Dean's conjecture

Abstract

Let the square of a tournament be the digraph on the same nodes with arcs where the directed distance in the tournament is at most two. This paper verifies Dean's conjecture: any tournament has a node whose outdegree is at least doubled in its square. © 1996 John Wiley & Sons, Inc.