Local limit theorem in random graphs and graphs on non-constant surfaces
<p>The thesis is split into two parts. In the first part we prove a local limit theorem for the number of appearances of the complete graph on four vertices, K<sub>4</sub>, in the Erdös-Rényi Random graph G(n, p) for p in (0, 1) a fixed constant. The proof of this is based on bound...
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | Thèse |
| Langue: | English |
| Publié: |
2019
|
| Sujets: |