Asymptotic enumeration, global structure, and constrained evolution
From MaRDI portal
Publication:5931454
DOI10.1016/S0012-365X(00)00211-9zbMath0965.05016WikidataQ105583790 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
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
06A07: Combinatorics of partially ordered sets
05C30: Enumeration in graph theory
05A16: Asymptotic enumeration
Related Items
On global site-percolation on the correlated honeycomb lattice, The number of \(K_{m,m}\)-free graphs, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Site percolation for a class of constrained honeycomb lattices, The number of hypergraphs without linear cycles, On hypergraphs without loose cycles, On the structure of clique-free graphs, The maximum degree of random planar graphs