Premium
Strong immersion is a well‐quasi‐ordering for semicomplete digraphs
Author(s) -
Barbero Florian,
Paul Christophe,
Pilipczuk Michał
Publication year - 2019
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22408
Subject(s) - immersion (mathematics) , mathematics , combinatorics , class (philosophy) , order (exchange) , discrete mathematics , pure mathematics , computer science , artificial intelligence , business , finance
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.