A well-quasi-order for tournaments

DOI10.1016/j.jctb.2010.10.003zbMath1221.05178OpenAlexW2079070096MaRDI QIDQ618033

Maria Chudnovsky, P. D. Seymour

Publication date: 14 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2010.10.003

zbMATH Keywords

digraphminorimmersiontournamentwell-quasi-order

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

On the Pathwidth of Almost Semicomplete Digraphs ⋮ Directed width parameters on semicomplete digraphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Rao's degree sequence conjecture ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Monoidal Width: Capturing Rank Width ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Forbidden directed minors and Kelly-width ⋮ A unified treatment of linked and lean tree-decompositions ⋮ Unnamed Item ⋮ A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ On width measures and topological problems on semi-complete digraphs ⋮ Tournament immersion and cutwidth ⋮ Tournaments and Semicomplete Digraphs ⋮ Well-quasi-ordering hereditarily finite sets ⋮ Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation ⋮ Tournament minors

Cites Work

• Rao's degree sequence conjecture
• Graph minors. XX: Wagner's conjecture
• Tournament immersion and cutwidth
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Ordering by Divisibility in Abstract Algebras