Article contents
A Theorem on Reconstruction of Random Graphs
Published online by Cambridge University Press: 12 September 2008
Abstract
In this paper we prove that given a finite collection of finite graphs, and the subsets of vertices of a random graph G that induce those graphs, it is almost always possible to uniquely reconstruct a class of graphs equivalent to G.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1993
References
- 6
- Cited by