Tournament Minors
Combinatorics
2012-06-15 v1 Discrete Mathematics
Abstract
We say a digraph is a {\em minor} of a digraph if can be obtained from a subdigraph of 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.
Keywords
Cite
@article{arxiv.1206.3135,
title = {Tournament Minors},
author = {Ilhee Kim and Paul Seymour},
journal= {arXiv preprint arXiv:1206.3135},
year = {2012}
}