Structure theorem for tournaments omitting N5

DOI10.1002/jgt.10081zbMath1016.05036OpenAlexW4250318288MaRDI QIDQ4800397

Brenda J. Latka

Publication date: 3 April 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10081

zbMATH Keywords

decompositionembeddingantichaindecidabilityindecomposablelocal ordertournament well-quasi-orderKruskalHigman

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Indecomposable tournaments and their indecomposable subtournaments on 5 vertices ⋮ The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) ⋮ Structure Theorem forU₅-free Tournaments ⋮ Invertibility of Digraphs and Tournaments ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament ⋮ A tournament approach to pattern avoiding matrices ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Inversions in tournaments ⋮ Indecomposable tournaments and their indecomposable subtournaments with six vertices ⋮ Unnamed Item ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments

Cites Work

• Tournaments whose Subtournaments are Irreducible or Transitive
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

This page was built for publication: Structure theorem for tournaments omitting N₅