Sharp threshold for $K_4$-percolation
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2017
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917081495109632 |
|---|---|
| author | Kolesnik, Brett |
| author_facet | Kolesnik, Brett |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1705_08882 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Sharp threshold for $K_4$-percolation Kolesnik, Brett Probability Combinatorics 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. |
| title | Sharp threshold for $K_4$-percolation |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/1705.08882 |