Threshold functions for extension statements

DOI10.1016/0097-3165(90)90061-ZzbMath0744.05068MaRDI QIDQ1812888

J. H. Spencer

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

random graph; threshold functions; graph extensions

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C99: Graph theory

Related Items

Threshold Functions for H-factors, Short Monadic Second Order Sentences about Sparse Random Graphs, Small subgraphs and their extensions in a random distance graph, First-order properties of bounded quantifier depth of very sparse random graphs, Counting restricted orientations of random graphs, The Reverse H‐free Process for Strictly 2‐Balanced Graphs, On fractional K‐factors of random graphs, Counting extensions revisited, Weak saturation stability, Weakly saturated subgraphs of random graphs, Cycle Saturation in Random Graphs, Bounded quantifier depth spectra for random graphs, On the spectra of first-order language properties for random graphs, Matching and covering the vertices of a random graph by copies of a given graph, On the number of \(r\)-transitive orientations of \(G(n,p)\), First order sentences about random graphs: small number of alternations, Quantifier alternation in first-order formulas with infinite spectra, Zero-one laws for \(k\)-variable first-order logic of sparse random graphs, Infinite spectra of first-order properties for random hypergraphs, Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations, Counting extensions