Almost every graph has reconstruction number three. (English) Zbl 0702.05061

The reconstrucion number was introduced by F. Harary and M. Plantholt [J. Graph Theory 9, 451-454 (1985; Zbl 0664.05043)] who conjectured that almost every graph has reconstruction number three. The paper contains a proof of this conjecture.
Reviewer: Th.Andreae


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


Zbl 0664.05043
Full Text: DOI


[1] Random Graphs, Academic Press, London, 1985, xvi + 447 pp.
[2] Harary, J. Graph Theory 9 pp 451– (1985)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.