Counting Connected Graphs Asymptotically

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on the random graph $G(k,p)$ for an appropriate edge probability $p$. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
23 pages

Keywords

Combinatorics, Probability

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74343

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0502579
 http://arxiv.org/abs/math/0502579

Collections

arXiv