Can I read Landau's Inequalities for Tournament Scores and a Short Proof of a Theorem on Transitive Sub-tournaments on EtoBox?

Landau's Inequalities for Tournament Scores and a Short Proof of a Theorem on Transitive Sub-tournaments by Richard A. Brualdi; Jian Shen is a Computer Science article available to read on EtoBox.

What is Landau's Inequalities for Tournament Scores and a Short Proof of a Theorem on Transitive Sub-tournaments about?

Ao and Hanson, and Guiduli, Gya  rfa  s, Thomasse  and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Á Á Á s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i and the sub-tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is, i dominates j whenever i b j and i j (mod 2). In this note, we give a much shorter proof of the result. In the course of doing so, we show that the score sequence of a tournament satis®es a set of inequalities which are individually stronger ÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐ Contract grant sponsor: NSERC.

Who reads Landau's Inequalities for Tournament Scores and a Short Proof of a Theorem on Transitive Sub-tournaments?

Author

Richard A. Brualdi; Jian Shen

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)

Published

2001

Language

EN

Field

Computer Science (Physical Sciences)