2-partition-transitive tournaments

DOI10.1006/jctb.1997.1806zbMath0914.05033OpenAlexW2006296146MaRDI QIDQ1272476

Peter Weidl, Barry Guiduli, András Gyárfás, Steéphan Thomassé

Publication date: 11 February 1999

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

Full work available at URL: https://semanticscholar.org/paper/79723e3b9b4fdf5cd6b1dfb236f642bf0110ba00

zbMATH Keywords

tournament score sequence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments ⋮ Decomposability index of tournaments ⋮ Cycle reversions and dichromatic number in tournaments ⋮ Reducing the dichromatic number via cycle reversions in infinite digraphs ⋮ Transitive partitions in realizations of tournament score sequences

Cites Work

• A theorem on flows in networks
• Largest digraphs contained in all n-tournaments
• Score vectors of tournaments
• Combinatorial Properties of Matrices of Zeros and Ones
• On the Score Sequence of an N-Partite Tournament
• Upsets in Round Robin Tournaments
• A Constructive Solution to a Tournament Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-partition-transitive tournaments