✦ LIBER ✦

Maximum Arc-integrity of Tournaments and Bipartite Tournaments

✍ Scribed by Robert C. Vandell

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 267 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00107-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complementary cycles containing a fixed

Complementary cycles containing a fixed arc in diregular bipartite tournaments

✍ Ke Min Zhang; Yannis Manoussakis; Zeng Min Song 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Let (x, y) be a specified arc in a k-regular bipartite tournament B. We prove that there exists a cycle C of length four through (x, y) in B such that B-C is hamiltonian.

On arc-traceable tournaments

✍ Arthur H. Busch; Michael S. Jacobson; K. B. Reid 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A digraph __D__ = (__V__, __A__) is arc‐traceable if for each arc __xy__ in __A__, __xy__ lies on a directed path containing all the vertices of __V__, that is, a hamiltonian path. Given a tournament __T__, it is well known that it contains a directed hamiltonian path. In this article,

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.

Pancyclic arcs and connectivity in tourn

Pancyclic arcs and connectivity in tournaments

✍ F. Havet 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract A __tournament__ is an orientation of the edges of a complete graph. An arc is __pancyclic__ in a tournament __T__ if it is contained in a cycle of length __l__, for every 3 ≤ __l__ ≤ |T|. Let __p__(__T__) denote the number of pancyclic arcs in a tournament __T__. In 4, Moon showed that

On 4-cycles in random bipartite tourname

On 4-cycles in random bipartite tournaments

✍ Béla Bollobés; Ove Frank; Michał KarońSki 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 2 views

We consider a random rn by n bipartite tournament T, , consisting of rnn independent random arcs which have a common probability p of being directed from the rn part to the n part. We determine the expected value and variance of the number of 4-cycles in T,,,, and the probability that T, , has no cy

Simple Markov-chain algorithms for gener

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

✍ Ravi Kannan; Prasad Tetali; Santosh Vempala 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in g