Asymptotic enumeration, global structure, and constrained evolution

DOI10.1016/S0012-365X(00)00211-9zbMath0965.05016OpenAlexW2052770391WikidataQ105583790 ScholiaQ105583790MaRDI QIDQ5931454

Hans Jürgen Prömel, Anusch Taraz, Angelika Steger

Publication date: 24 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00211-9

zbMATH Keywords

phase transitionrandom graphsasymptotic enumerationglobal structure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (8)

The number of hypergraphs without linear cycles ⋮ The maximum degree of random planar graphs ⋮ On hypergraphs without loose cycles ⋮ The number of \(K_{m,m}\)-free graphs ⋮ On the structure of clique-free graphs ⋮ On global site-percolation on the correlated honeycomb lattice ⋮ Asymptotic probabilities of extension properties and random \(l\)-colourable structures ⋮ Site percolation for a class of constrained honeycomb lattices

This page was built for publication: Asymptotic enumeration, global structure, and constrained evolution