✦ LIBER ✦

A generalization of rotational tournaments

✍ Scribed by E. Barbut; A. Bialostocki

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 623 KB
Volume: 76
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90301-4

No coin nor oath required. For personal study only.

✦ Synopsis

The notions of rotational tournament and the associated symbol set are generalized to r-tournaments. It is shown that a necessary and sufficient condition for the existence of a rotational r-tournament on n vertices is (n, r) = 1. A scheme to generate rotational r'tournaments is given, along with some examples.

📜 SIMILAR VOLUMES

Locally semicomplete digraphs: A general

Locally semicomplete digraphs: A generalization of tournaments

✍ Jørgen Bang-Jensen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 1022 KB

## Abstract In this paper we introduce a new class of directed graphs called locally semicomplete digraphs. These are defined to be those digraphs for which the following holds: for every vertex __x__ the vertices dominated by __x__ induce a semicomplete digraph and the vertices that dominate __x__

Generalizations of tournaments: A survey

✍ Bang-Jensen, J�rgen; Gutin, Gregory 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB

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 cycle

Vertices of the generalized transitive t

Vertices of the generalized transitive tournament polytype

✍ Alberto Borobia 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 249 KB

A nonnegative matrix T = (t~)~= t is a generalized transitive tournament matrix (GTT matrix) ift, = 0, t~ = 1 -tjl for i ~j, and 1 ~< t~ i + t~. + tk~ ~< 2 for i,j,k pairwise distinct. An approach to the problem of characterize the set of vertices of the polytope {GTT }, of all GTT matrices of order

The complexity of finding generalized pa

The complexity of finding generalized paths in tournaments

✍ Pavol Hell; Moshe Rosenfeld 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 405 KB

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

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