Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

TL;DR

This paper proves that directed graphs avoiding paths with a limited number of direction changes are well-quasi-ordered under the strong immersion relation, extending the understanding of graph orderings in directed settings.

Contribution

It establishes that digraphs excluding paths with bounded direction changes are well-quasi-ordered by strong immersion, even with vertex labels, for all finite bounds.

Findings

Digraphs with no path changing direction more than k times are well-quasi-ordered.

Paths with arbitrarily many direction changes form infinite antichains.

The result is optimal for classes closed under subgraphs.

Abstract

Nash-Williams' Strong Immersion Conjecture states that graphs are well-quasi-ordered by the strong immersion relation. That is, given infinitely many graphs, one graph contains another graph as a strong immersion. In this paper we study the analogous problem for directed graphs. It is known that digraphs are not well-quasi-ordered by the strong immersion relation, but for all known such infinite antichains, paths that change direction arbitrarily many times can be found. This paper proves that the converse statement is true: for every positive integer $k$, the digraphs that do not contain a path that changes direction $k$ times are well-quasi-ordered by the strong immersion relation, even when vertices are labelled by a well-quasi-order. This result is optimal for classes of digraphs closed under taking subgraphs since paths that change direction arbitrarily many times with vertex-labels form an infinite antichain with respect to the strong immersion relation.