scientific article; zbMATH DE number 426367

zbMATH Open0792.03016MaRDI QIDQ3137216FDOQ3137216

Authors: Joel Spencer 

Publication date: 1 November 1993

Title of this publication is not available (Why is that?)

Recommendations

• The first order theory of \(G(n, c/n)\)
• Infinitary logics and very sparse random graphs
• A simpler axiomatization of the Shelah-Spencer almost sure theories
• scientific article; zbMATH DE number 1028229
• Probabilities of Sentences about Very Sparse Random Graphs

zbMATH Keywords

random graphsadjacencycountable modelcountable theoriesfirst-order theory of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Categoricity and completeness of theories (03C35) Model theory of denumerable and separable structures (03C15)

Cited In (8)

• On compactness of logics that can express properties of symmetry or connectivity
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
• Random graphs with a random bijection
• The first-order contiguity of sparse random graphs with prescribed degrees
• Limits of sparse configuration models and beyond: graphexes and multigraphexes
• A simpler axiomatization of the Shelah-Spencer almost sure theories
• Probabilities of Sentences about Very Sparse Random Graphs
• The first order theory of \(G(n, c/n)\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137216)