Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments

DOI10.1002/jgt.10008zbMath0996.05064OpenAlexW4229664808MaRDI QIDQ4539870

Jian Shen, Richard A. Brualdi

Publication date: 11 July 2002

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

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

zbMATH Keywords

tournament score sequenceLandau's inequalities

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Tournaments, oriented graphs and football sequences ⋮ Score sequences in oriented graphs ⋮ Spectra of digraphs ⋮ Transitive partitions in realizations of tournament score sequences ⋮ On scores in tournaments ⋮ On scores, losing scores and total scores in hypertournaments

Cites Work

• A theorem on flows in networks
• 2-partition-transitive tournaments
• Combinatorial Properties of Matrices of Zeros and Ones

This page was built for publication: Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments