Strong immersion is a well-quasi-ordering for semi-complete digraphs
classification
💻 cs.DM
math.CO
keywords
classdigraphsimmersionsemi-completestrongwell-quasi-orderingchudnovskyholds
read the original abstract
We prove that the strong immersion order is a well-quasi-ordering on the class of semi-complete digraphs, thereby strengthening a result of Chudnovsky and Seymour that this holds for the class of tournaments.
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.