Subtournaments isomorphic to \(W_5\) in a indecomposable tournament

DOI10.1016/j.crma.2012.03.012zbMath1242.05106MaRDI QIDQ424734

Imed Boudabbous, Houmem Belkhechine, Kaouthar Hzami

Publication date: 4 June 2012

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2012.03.012

zbMATH Keywords

tournament well-quasi-order

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-model theory -- A personal perspective
• Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
• Primitivity is hereditary for 2-structures
• Either tournaments or algebras?
• Indecomposable graphs
• Minimal indecomposable graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• On an adjacency property of almost all tournaments
• Some remarks on simple tournaments
• Probabilities on finite models
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
• Structure theorem for tournaments omitting N₅