Structure theorem for tournaments omitting N5

DOI10.1002/jgt.10081zbMath1016.05036MaRDI 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

decomposition; embedding; antichain; decidability; indecomposable; local order; tournament well-quasi-order; Kruskal; Higman

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

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

Cites Work

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