Tournament Minors
classification
🧮 math.CO
cs.DM
keywords
digraphminorsubdigraphclasscontainmentcontractinghereminors
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.