Threshold spectra via the Ehrenfeucht game
From MaRDI portal
Publication:757267
DOI10.1016/0166-218X(91)90048-2zbMath0722.90095WikidataQ127740781 ScholiaQ127740781MaRDI QIDQ757267
Publication date: 1991
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) 2-person games (91A05) Games involving graphs (91A43)
Related Items (19)
On limit points of spectra of the random graph first-order properties ⋮ Bounded quantifier depth spectra for random graphs ⋮ Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ \( \gamma \)-variable first-order logic of preferential attachment random graphs ⋮ Zero-one laws with variable probability ⋮ A zero‐one law for a random subset ⋮ Probabilities of Sentences about Very Sparse Random Graphs ⋮ On the spectra of first-order language properties for random graphs ⋮ First order sentences about random graphs: small number of alternations ⋮ Logical laws for short existential monadic second-order sentences about graphs ⋮ Logical laws for existential monadic second-order sentences with infinite first-order parts ⋮ Infinitary logics and 0-1 laws ⋮ MSO 0-1 law for recursive random trees ⋮ Random graph orders do not satisfy a 0–1 law ⋮ Zero-one laws for \(k\)-variable first-order logic of sparse random graphs ⋮ Zero-one laws for random \(k\)-partite graphs ⋮ Zero-one laws for sentences with \(k\) variables ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs ⋮ On the 4-spectrum of first-order properties of random graphs
Cites Work
This page was built for publication: Threshold spectra via the Ehrenfeucht game
