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