scientific article; zbMATH DE number 426367

MaRDI QIDQ3137216zbMATHFDO

Authors Joel Spencer

Publication date 1 November 1993

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)

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

Cited in

(9)

• On compactness of logics that can express properties of symmetry or connectivity
• 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)\)
• Random graphs in the monadic theory of order
• The first-order contiguity of sparse random graphs with prescribed degrees
• Randomness and semigenericity
• Limits of sparse configuration models and beyond: graphexes and multigraphexes
• Random graphs with a random bijection

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)