𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycles and paths in bipartite tournaments with spanning configurations

✍ Scribed by R. Häggkvist; Y. Manoussakis

Book ID
105469607
Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
362 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Longest paths and cycles in bipartite or
Longest paths and cycles in bipartite oriented graphs
✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Spanning Cycles Through Specified Edges
Spanning Cycles Through Specified Edges in Bipartite Graphs
✍ Reza Zamani; Douglas B. West 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

P ósa proved that if G is an n-vertex graph in which any two nonadjacent vertices have degree-sum at least n+k, then G has a spanning cycle containing any specified family of disjoint paths with a total of k edges. We consider the analogous problem for a bipartite graph G with n vertices and parts o