Strong immersion is a well‐quasi‐ordering for semicomplete digraphs
Florian Barbero, Christophe Paul, Michał Pilipczuk · Journal of Graph Theory · 2018
Abstract We prove that the strong immersion order is a well‐quasi‐ordering on the class of semicomplete digraphs, thereby strengthening a result of Chudnovsky and Seymour (2011, J. Comb. Theory, Series B, 101, 47–53) that this holds for the class of tournaments.