A Theorem on Reconstruction of Random Graphs

DOI10.1017/S0963548300000444zbMath0796.05086MaRDI QIDQ4289302

Cleide S. Martins, Peter J. Cameron

Publication date: 15 September 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

automorphismequivalence relationsrandom graphsfirst order sentencesreconstruction

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Other applications of logic (03B80)

Related Items (1)

Reconstruction of a coloring from its homogeneous sets

Cites Work

• A semi-strong perfect graph theorem
• Properties of almost all graphs and complexes
• On Sets of Acquaintances and Strangers at any Party
• Reducts of the random graph
• Probabilities on finite models

This page was built for publication: A Theorem on Reconstruction of Random Graphs