Strong immersion is a well-quasi-ordering for semi-complete digraphs

TL;DR

This paper proves that the strong immersion order forms a well-quasi-ordering on semi-complete digraphs, extending previous results from tournaments to a broader class of digraphs.

Contribution

It generalizes the known well-quasi-ordering property from tournaments to semi-complete digraphs under the strong immersion order.

Findings

Strong immersion order is a well-quasi-ordering for semi-complete digraphs.

Extends previous results from tournaments to semi-complete digraphs.

Strengthens the theoretical understanding of digraph orderings.

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.