Threshold functions for extension statements
From MaRDI portal
Recommendations
Cited in
(23)- Weakly saturated subgraphs of random graphs
- Bounded quantifier depth spectra for random graphs
- Counting restricted orientations of random graphs
- Counting extensions revisited
- On the spectra of first-order language properties for random graphs
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Small subgraphs and their extensions in a random distance graph
- Threshold Functions for H-factors
- On fractional K‐factors of random graphs
- Weak saturation stability
- Infinite spectra of first-order properties for random hypergraphs
- Maximum number of symmetric extensions in random graphs
- Short monadic second order sentences about sparse random graphs
- Counting extensions
- Matching and covering the vertices of a random graph by copies of a given graph
- First-order properties of bounded quantifier depth of very sparse random graphs
- 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
- Cycle Saturation in Random Graphs
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
- Threshold for stability of weak saturation
- The reverse \(H\)-free process for strictly 2-balanced graphs
This page was built for publication: Threshold functions for extension statements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812888)
