✦ LIBER ✦

Generalizations of tournaments: A survey

✍ Scribed by Bang-Jensen, J�rgen; Gutin, Gregory

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 376 KB
Volume: 28
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-g

No coin nor oath required. For personal study only.

✦ Synopsis

We survey results concerning various generalizations of tournaments.

The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycles. The reader will see that although these problems are polynomially solvable for all of the classes described, they can be highly nontrivial, even for these ''tournament-like'' digraphs.

📜 SIMILAR VOLUMES

A Characterization of Unique Tournaments

✍ Prasad Tetali 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 256 KB

We call a tournament unique, if there is no other tournament (barring isomorphic ones) which shares the same score vector. In this note, we provide a simple characterization of such unique tournaments. ## 1998 Academic Press Theorem 1. There are exactly four (basic) strong tournaments in Unique (s

Emulsions in industry—a general survey

✍ King, A. ;Bennister, H. L. 📂 Article 📅 1938 🏛 Wiley (John Wiley & Sons) ⚖ 351 KB

Chemotherapy of advanced breast cancer a

Chemotherapy of advanced breast cancer a general survey

✍ Alan P. Lyss; Virgil Loeb Jr 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 508 KB

Generalizations of Semiorders: A Review

Generalizations of Semiorders: A Review Note

✍ Peter C. Fishburn 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Semiorders may form the simplest class of partially ordered sets that accommodate thresholds of discriminability in binary comparisons. Many other classes of ordered sets that generalize the uniform-threshold feature of semiorders have been studied in recent years. This note describes a variety of g

Seymour's Second Neighborhood Conjecture

Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star

✍ Salman Ghazal 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Seymour's Second Neighborhood Conjecture asserts that every digraph (without digons) has a vertex whose first out‐neighborhood is at most as large as its second out‐neighborhood. We prove its weighted version for tournaments missing a generalized star. As a consequence the weighted vers

Regulation of genetic expression. Genera

Regulation of genetic expression. General survey

✍ Mirsky, Alfred E. 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB