A Theorem on Reconstruction of Random Graphs

DOI10.1017/S0963548300000444zbMATH Open0796.05086MaRDI QIDQ4289302FDOQ4289302

Authors: Peter J. Cameron, Cleide S. Martins 

Publication date: 15 September 1994

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

Recommendations

• scientific article; zbMATH DE number 3893250
• scientific article; zbMATH DE number 1146222
• scientific article; zbMATH DE number 4023332
• Reconstructing infinite objects

zbMATH Keywords

reconstructionautomorphismrandom graphsequivalence relationsfirst order sentences

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)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reconstruction of graphs based on random walks
• Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
• Shotgun assembly of Erdős-Rényi random graphs
• Reconstruction of a coloring from its homogeneous sets
• Title not available (Why is that?)

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

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