Random Planar Maps and Graphs with Minimum Degree Two and Three
| Autor: | Lander Ramos, Marc Noy |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Random graph
Degree (graph theory) Applied Mathematics Probability (math.PR) Graph theory Tree (graph theory) Theoretical Computer Science Planar graph Combinatorics symbols.namesake Planar 05A16 Computational Theory and Mathematics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Core (graph theory) FOS: Mathematics symbols Mathematics - Combinatorics Discrete Mathematics and Combinatorics Combinatorics (math.CO) Geometry and Topology Constant (mathematics) Mathematics - Probability MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | The Electronic Journal of Combinatorics. 25 |
| ISSN: | 1077-8926 |
| DOI: | 10.37236/7640 |
| Popis: | We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to the core of a random planar graph is of order c log(n) for an explicit constant c. These results provide new information on the structure of random planar graphs. Comment: 32 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|