𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameters of random bipartite graphs

✍ Scribed by Béla Bollobás; Victor Klee

Book ID
110564206
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
485 KB
Volume
4
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On large bipartite graphs of diameter 3
On large bipartite graphs of diameter 3
✍ Feria-Purón, Ramiro; Miller, Mirka; Pineda-Villavicencio, Guillermo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 296 KB
The random bipartite nearest neighbor gr
The random bipartite nearest neighbor graphs
✍ Boris Pittel; Robert S. Weishaar 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

The bipartite kth nearest neighbor graphs B are studied. It is shown that B k 1 has a limiting expected matching number of approximately 80% of its vertices, that with high Ž . probability whp B has at least 2 log nr13 log log n vertices not matched, and that whp B 2 3 does have a perfect matching.

Large bipartite graphs with given degree
Large bipartite graphs with given degree and diameter
✍ C. Delorme 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 1 views

W e give constructions of bipartite graphs with maximum A, diameter D on B vertices. such :bat for every D 3 2 :he !im i nf , . . , B . A'"' = b,, > 0. W e also improve similar results on ordinary graphs, for example, w e prove that lim, , , N -A-." = 1 if D is 3 or 5. This is a partial answer to a