A well-quasi-order for tournaments

DOI10.1016/J.JCTB.2010.10.003MaRDI QIDQ618033zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Paul 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

minordigraphtournamentimmersionwell-quasi-order

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Strong immersion is a well-quasi-ordering for semicomplete digraphs
• On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
• Tournament immersion and cutwidth
• Tournament minors
• Well-quasi-ordering hereditarily finite sets

Cites work

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

Cited in

(29)

• Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
• Cutwidth: obstructions and algorithmic aspects
• Polynomial kernel for immersion hitting in tournaments
• Circulant tournaments of prime order are tight
• Monoidal Width: Capturing Rank Width
• A unified treatment of linked and lean tree-decompositions
• Rao's degree sequence conjecture
• Tournament minors
• On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
• Immersion of transitive tournaments in digraphs with large minimum outdegree
• On the pathwidth of almost semicomplete digraphs
• On tournaments of small orders and their applications
• Strong immersion is a well-quasi-ordering for semicomplete digraphs
• 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
• A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
• scientific article; zbMATH DE number 784689 (Why is no real title available?)
• Recent progress on well-quasi-ordering graphs
• On width measures and topological problems on semi-complete digraphs
• On digraphs without onion star immersions
• Directed width parameters on semicomplete digraphs
• Well-quasi-ordering hereditarily finite sets
• Tournament immersion and cutwidth
• Tournaments and Semicomplete Digraphs
• Isomorphism for tournaments of small twin width
• Forbidden directed minors and Kelly-width
• Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
• Recent techniques and results on the Erdős-Pósa property
• Well-quasi-ordering hereditarily finite sets

This page was built for publication: A well-quasi-order for tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618033)