Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1705.08882 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We locate the critical threshold $p_c$ at which it becomes likely that the complete graph $K_n$ can be obtained from the Erdős-Rényi graph ${\cal G}_{n,p}$ by iteratively completing copies of $K_4$ minus an edge. This refines work of Balogh, Bollobás and Morris that bounds the threshold up to multiplicative constants.