✦ LIBER ✦

Matchings in random regular bipartite digraphs

✍ Scribed by David W. Walkup

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 505 KB
Volume: 31
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90172-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local Strongly Arc-Connectivity in Regul

Local Strongly Arc-Connectivity in Regular Bipartite Digraphs

✍ J.M. Xu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 99 KB

We show that for any vertex \(x\) of a \(d\)-regular bipartite digraph there are a vertex \(y\), in the other class of the bipartition, and \(d(x, y)\)-paths and \(d(y, x)\)-paths such that all \(2 d\) of them are pairwise arc-disjoint. This result generalizes a theorem of Hamidoune and Las Vergnas

Induced matchings in bipartite graphs

✍ R.J. Faudree; A. Gyárfas; R.H. Schelp; Zs. Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Random Matchings Which Induce Hamilton C

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

✍ Jeong Han Kim; Nicholas C. Wormald 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set

Special parity of perfect matchings in b

Special parity of perfect matchings in bipartite graphs

✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n

Maintaining bipartite matchings in the p

Maintaining bipartite matchings in the presence of failures

✍ Edwin Hsing-Mean Sha; Kenneth Steiglitz 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1013 KB

Perfect fractional matchings in random h

Perfect fractional matchings in random hypergraphs

✍ Michael Krivelevich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Given an r-uniform hypergraph H = (V, E ) on ( V ( = n vertices, a real-valued function f(e) 5 1 for all u E V and C e E E f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n + m , at the very moment to when the last isolated