Strong immersion is a well-quasi-ordering for semi-complete digraphs
Discrete Mathematics
2017-07-13 v1 Combinatorics
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.
Cite
@article{arxiv.1707.03563,
title = {Strong immersion is a well-quasi-ordering for semi-complete digraphs},
author = {Florian Barbero and Christophe Paul and Michal Pilipczuk},
journal= {arXiv preprint arXiv:1707.03563},
year = {2017}
}