First-order and monadic properties of highly sparse random graphs
type: Item
instance of: scholarly article
title: First-order and monadic properties of highly sparse random graphs
zbMATH Open document ID: 1357.05140
DOI: 10.1134/S1064562416050240
author: L. B. Ostrovskii
author: M. E. Zhukovskii
published in: Doklady Mathematics
publication date: 2017-02-27T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 60F20
zbMATH DE Number: 6688876
zbMATH Keywords: monadic zero-one \(k\)-law
MaRDI profile type: Publication
cites work: Q4255575
cites work: Random graphs: models and asymptotic characteristics
cites work: Succinct definitions in the first order theory of graphs
cites work: A logical approach to asymptotic combinatorics. II: Monadic second-order properties
cites work: Q4519896
cites work: Random graphs.
cites work: Zero-One Laws for Sparse Random Graphs
cites work: Zero-one laws for first-order formulas with a bounded quantifier depth
cites work: Zero-one \(k\)-law
cites work: Extension of the zero-one \(k\)-law
cites work: The largest critical point in the zero-one k-law
cites work: On the zero-one 4-law for the Erdős-Rényi random graphs
full work available at URL: s1064562416050240
OpenAlex ID: W2549896219
description: scientific article; zbMATH DE number 6688876