Estimation of the number of maximal extensions in a random graph

DOI10.1515/dma-2012-006zbMath1263.05100OpenAlexW2011730652MaRDI QIDQ4917387

M. E. Zhukovskii

Publication date: 29 April 2013

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2012-006

zbMATH Keywords

complete graphsmaximal pairsresidual graphsneutral pairsnumber of safe extensions of subgraphs in a random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Zero-one laws (60F20)

Related Items (9)

Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ On the zero-one \(k\)-law extensions ⋮ Short Monadic Second Order Sentences about Sparse Random Graphs ⋮ Limit points of spectra for first-order properties of random hypergraphs ⋮ Extension of the zero-one \(k\)-law ⋮ Quantifier alternation in first-order formulas with infinite spectra ⋮ First order sentences about random graphs: small number of alternations ⋮ Bounded quantifier depth spectrum for random uniform hypergraphs ⋮ Infinite spectra of first-order properties for random hypergraphs

This page was built for publication: Estimation of the number of maximal extensions in a random graph