𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering a Graph by Forests and a Matching

✍ Scribed by Kaiser, Tomáš; Montassier, Mickaël; Raspaud, André

Book ID
118197927
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
161 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching and covering the vertices of a
Matching and covering the vertices of a random graph by copies of a given graph
✍ Andrzej Ruciński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 747 KB

## Rucidski, A., Matching and covering the vertices of a random graph by copies of a given graph, Discrete Mathematics 105 (1992) 185-197. In this paper we partially answer the question: how slowly must p(n) converge to 0 so that a random graph K(n, p) has property PM, almost surely, where PM, me