scientific article
From MaRDI portal
Publication:3781137
zbMath0639.05045MaRDI QIDQ3781137
Andrew Vince, Andrzej Ruciński
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Bounded quantifier depth spectra for random graphs ⋮ When are small subgraphs of a random graph normally distributed? ⋮ Universal zero-one \(k\)-law ⋮ Small subgraphs and their extensions in a random distance graph ⋮ Subgraph counts in random graphs using incomplete U-statistics methods ⋮ Counting \(H\)-free graphs ⋮ Poisson approximation of subgraph counts in stochastic block models and a graphon model ⋮ Quantifier alternation in first-order formulas with infinite spectra ⋮ The median of the number of simple paths on three vertices in the random graph ⋮ First order sentences about random graphs: small number of alternations ⋮ Variance of the subgraph count for sparse Erdős-Rényi graphs ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Transforming a graph into a 1-balanced graph ⋮ Small Subgraphs in Random Distance Graphs ⋮ Zero-one laws for \(k\)-variable first-order logic of sparse random graphs ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ Balanced extensions of graphs and hypergraphs
This page was built for publication:
