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

DOI10.1016/j.jctb.2022.08.007zbMath1504.05110arXiv2007.15822OpenAlexW3046419153MaRDI QIDQ2099416

Chun-Hung Liu, Irene Muzi

Publication date: 23 November 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.15822

zbMATH Keywords

directed graphswell-quasi-orderingstrong immersion

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A well-quasi-order for tournaments
• Graph minors. XX: Wagner's conjecture
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph minors. V. Excluding a planar graph
• On well-quasi-ordering-finite graphs by immersion
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Graph minors. XIII: The disjoint paths problem
• Recent Progress on Well-Quasi-ordering Graphs
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• On the presence of disjoint subgraphs of a specified type
• Strong immersion is a well‐quasi‐ordering for semicomplete digraphs
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation