Skip to Main content Skip to Navigation

Airy Phenomena and Analytic Combinatorics of Connected Graphs

Philippe Flajolet 1 Bruno Salvy 1 Gilles Schaeffer 2
1 ALGO - Algorithms
Inria Paris-Rocquencourt
2 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The enumeration of connected graphs has been so far dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipulations. We show here that it is possible to make analytic sense of the divergent series that expresses the generating function of connected graphs. As a consequence, it becomes possible to derive analytically known enumeration results using only first principles of combinatorial analysis and straight asymptotic analysis---specifically, the saddle-point method. The enumeration of connected graphs by excess derives from a simple saddle-point analysis; furthermore, a refined analysis based on coalescent saddle points yields an explicit connection with Airy functions.
Document type :
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:55:10 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00101063, version 1



Philippe Flajolet, Bruno Salvy, Gilles Schaeffer. Airy Phenomena and Analytic Combinatorics of Connected Graphs. [Intern report] A02-R-216 || flajolet02a, 2002, 25 p. ⟨inria-00101063⟩



Record views