Threshold functions for small subgraphs: an analytic approach
Authors:
- Gwendal ColletGCGwendal Collet
- Élie de PanafieuÉPÉlie de Panafieu
- Danièle GardyDGDanièle Gardy
- Bernhard GittenbergerBGBernhard Gittenberger
- Vlady RavelomananaVRVlady Ravelomanana
- 1 August 2017
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 61, 271-277
Abstract
No abstract availableAll Related Versions
Funding Information
- FWF (SFB F50-02)
- FWF (F5004)
- PICS (2017-19)
- ACCA
- FWF (SFB F50-03)
- PICS
- ACCA (2017-19)
This publication has 8 references indexed in Scilit:
- Subgraph statistics in subcritical graph classesRandom Structures & Algorithms, 2017
- Upper tails for subgraph counts in random graphsIsrael Journal of Mathematics, 2004
- Asymptotic Enumeration by Degree Sequence of Graphs of High DegreeEuropean Journal of Combinatorics, 1990
- When are small subgraphs of a random graph normally distributed?Probability Theory and Related Fields, 1988
- Poisson convergence and poisson processes with applications to random graphsStochastic Processes and their Applications, 1987
- Strongly balanced graphs and random graphsJournal of Graph Theory, 1986
- Threshold functions for small subgraphsMathematical Proceedings of the Cambridge Philosophical Society, 1981
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980