%0 Journal Article
%T Tournament Minors
%A Ilhee Kim
%A Paul Seymour
%J Computer Science
%D 2012
%I arXiv
%X We say a digraph $G$ is a {\em minor} of a digraph $H$ if $G$ can be obtained from a subdigraph of $H$ by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment.
%U http://arxiv.org/abs/1206.3135v1