✦ LIBER ✦

Even tournaments and Hadamard tournaments

✍ Scribed by Noboru Ito

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 309 KB
Volume: 151
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00088-z

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss several tournaments. results and problems of even tournaments and Hadamard

📜 SIMILAR VOLUMES

On Hadamard tournaments

✍ Noboru Ito 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Tournament games and positive tournament

Tournament games and positive tournaments

✍ David C. Fisher; Jennifer Ryan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 799 KB

## Abstract Given a tournament __T__, the __tournament game__ on __T__ is as follows: Two players independently pick a node of __T.__ If both pick the same node, the game is tied. Otherwise, the player whose node is at the tail of the arc connecting the two nodes wins. We show that the optimal mixe

Doubly regular tournaments are equivalen

Doubly regular tournaments are equivalent to skew hadamard matrices

✍ K.B Reid; Ezra Brown 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Interval Tournaments

✍ David E. Brown; Arthur H. Busch; J. Richard Lundgren 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract A tournament is an orientation of a complete graph. A directed graph is an interval digraph if for each vertex __v__ there corresponds an ordered pair of intervals (__S~v~__, __T~v~__) such that __u__ → __v__ if and only if __S~u~__ ∩ __T~v~__ ≠ ∅︁. A bipartite graph is an interval bigr

Ordered tournaments and ordered triplewh

Ordered tournaments and ordered triplewhist tournaments with the three person property

✍ R. J. R. Abel; Gennian Ge 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract It is well known that an ordered tournament OWh(__v__) exists if and only if __v__ ≡ 1 (mod 4), __v__ ≥ 5. An ordered triplewhist tournament on __v__ players is said to have the three person property if no two games in the tournament have three common players. We briefly denote such a d

Quasi-random tournaments

✍ F. R. K. Chung; R. L. Graham 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 724 KB

## Abstract We introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all. In contrast to rando