𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the evolution of a random tournament

✍ Scribed by Tomasz Łuczak; Andrzej Ruciński; Jacek Gruszka

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
280 KB
Volume
148
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the asymptotic distributions of subgr
On the asymptotic distributions of subgraph counts in a random tournament
✍ Pontus Andersson 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

A random tournament T is obtained by independently orienting the edges of n 1 the complete graph on n vertices, with probability for each direction. We study the 2 asymptotic distribution, as n tends to infinity, of a suitable normalization of the number of subgraphs of T that are isomorphic to a gi

On the existence of specified cycles in
On the existence of specified cycles in a tournament
✍ Abdelhamid Benhocine; A. Pawel Wojda 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB 👁 1 views

For 2 s p s n and n 2 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p -1 consecutives edges. In this paper, we prove that every tournament of order n 2 7 contains D(n, p ) for p = 2, 3, ..., n. Furthermore, we determine the t

On the Structure of Local Tournaments
On the Structure of Local Tournaments
✍ J. Huang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A local tournament is an oriented graph in which the inset, as well as the outset, of every vertex induces a tournament. Local tournaments are interesting in their own right, as they share many nice properties of tournaments. They are also of interest because of their relation to proper circular arc

The phase transition in the evolution of
The phase transition in the evolution of random digraphs
✍ Tomasz Łuczak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract Let \documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {\rm D}\limits^ \to $\end{document}(__n, M__) denote a digraph chosen at random from the family of all digraphs on __n__ vertices with __M__ arcs. We shall prove that if __M__/__n__ ≤ __c__ < 1 and ω(__n__) → ∞, then