We say a digraph G is a 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 that the class of all tournaments is a well-quasi-order under minor containment.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics