The strange logic of random graphs
From MaRDI portal
Publication:5939775
zbMath0976.05001MaRDI QIDQ5939775
Publication date: 30 July 2001
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
03B10: Classical first-order logic
Related Items
How complex are random graphs in first order logic?, Descriptive complexity of finite structures: Saving the quantifier rank, Zero-one \(k\)-law, The first order definability of graphs: Upper bounds for quantifier depth, Geography of local configurations, Upper tails for subgraph counts in random graphs, On the lengths of symmetry breaking-preserving games on graphs, Modular statistics for subgraph counts in sparse random graphs, Succinct definitions in the first order theory of graphs, Decomposable graphs and definitions with no quantifier alternation, The complexity of random ordered structures, A simpler axiomatization of the Shelah-Spencer almost sure theories, The first order definability of graphs with separators via the Ehrenfeucht game, A Limit Law of Almost l-partite Graphs, On rational limits of Shelah–Spencer graphs, Homomorphism-homogeneous graphs, On generic structures with a strong amalgamation property, Random Graphs, Retractions and Clique Graphs
