Threshold functions for extension statements
From MaRDI portal
Publication:1812888
DOI10.1016/0097-3165(90)90061-ZzbMath0744.05068MaRDI QIDQ1812888
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items (21)
Bounded quantifier depth spectra for random graphs ⋮ On fractional K‐factors of random graphs ⋮ Counting extensions ⋮ Threshold Functions for H-factors ⋮ Short Monadic Second Order Sentences about Sparse Random Graphs ⋮ Small subgraphs and their extensions in a random distance graph ⋮ Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations ⋮ On the spectra of first-order language properties for random graphs ⋮ Counting extensions revisited ⋮ Weak saturation stability ⋮ On the number of \(r\)-transitive orientations of \(G(n,p)\) ⋮ Quantifier alternation in first-order formulas with infinite spectra ⋮ Weakly saturated subgraphs of random graphs ⋮ First order sentences about random graphs: small number of alternations ⋮ Cycle Saturation in Random Graphs ⋮ First-order properties of bounded quantifier depth of very sparse random graphs ⋮ Counting restricted orientations of random graphs ⋮ Matching and covering the vertices of a random graph by copies of a given graph ⋮ Zero-one laws for \(k\)-variable first-order logic of sparse random graphs ⋮ Infinite spectra of first-order properties for random hypergraphs ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs
This page was built for publication: Threshold functions for extension statements
