✦ LIBER ✦

On the maximum cardinality of a consistent set of arcs in a random tournament

✍ Scribed by W Fernandez de la Vega

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 170 KB
Volume: 35
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90060-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum number of arc-disjoint arbor

The maximum number of arc-disjoint arborescences in a tournament

✍ Ma Chung-fan; Cai Mao-cheng 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

## Abstract In this article, we give the maximum number of arc‐disjoint arborescences in a tournament or an oriented complete __r__‐partite graph by means of the indegrees of its vertices.

On the evolution of a random tournament

✍ Tomasz Łuczak; Andrzej Ruciński; Jacek Gruszka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 280 KB

The number of pancyclic arcs in a k-stro

The number of pancyclic arcs in a k-strong tournament

✍ Anders Yeo 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

## Abstract A __tournament__ is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is __pancyclic__ in a digraph __D__, if it belongs to a cycle of length __l__, for all 3 ≤ __l__ ≤ |__V__ (__D__) |. Let __p__(__D__) denote the number of pancyclic arcs in a

Maximum Antichains in Random Subsets of

Maximum Antichains in Random Subsets of a Finite Set

✍ Deryk Osthus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

The Cardinality of the Collection of Max

The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph

✍ Shu-Chu Chang; Yeong-Nan Yeh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

An independent set or stable set of a graph G V, E is a subset S of the Ž . vertices set V in which no two are adjacent. Let G be the number of vertices in Ž . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little

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