𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the threshold fork-regular subgraphs of random graphs

✍ Scribed by Paweł Prałat; Jacques Verstraëte; Nicholas Wormald

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
232 KB
Volume
31
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

On the chromatic number of a random 5-re
On the chromatic number of a random 5-regular graph
✍ J. Díaz; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. Pérez; N. Wormald 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as

Analysis of edge deletion processes on f
Analysis of edge deletion processes on faulty random regular graphs
✍ Andreas Goerdt; Mike Molloy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Random regular graphs are, at least theoretically, popular communication networks. The reason for this is that they combine low (that is constant) degree with good expansion properties crucial for e cient communication and load balancing. When any kind of communication network gets large one is face