Omer Gimenez ; Marc Noy - The number of planar graphs and properties of random planar graphs

dmtcs:3354 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms - https://doi.org/10.46298/dmtcs.3354
The number of planar graphs and properties of random planar graphs

Authors: Omer Gimenez 1; Marc Noy 1

  • 1 Universitat Politècnica de Catalunya [Barcelona]

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

https://doi.org/10.46298/dmtcs.3354
Source: HAL:hal-01184026v1
Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: limit law,asymptotic enumeration,analytic combinatorics,normal law,Planar graph,random graph,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.13097/archive-ouverte/unige:43269
  • 10.13097/archive-ouverte/unige:43269
Dynamics and combinatorics of 2 and 3 dimensional triangulations

3 Documents citing this article

Share and export

Consultation statistics

This page has been seen 152 times.
This article's PDF has been downloaded 137 times.