A Theorem on Reconstruction of Random Graphs

Peter J. Cameron; Cleide Martins

doi:10.1017/S0963548300000444

A Theorem on Reconstruction of Random Graphs

Peter J. Cameron, Cleide Martins

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1-9
Number of pages	9
Journal	Combinatorics, Probability and Computing
Volume	2
Issue number	1
DOIs	https://doi.org/10.1017/S0963548300000444
Publication status	Published - 1 Jan 1993

Access to Document

10.1017/S0963548300000444

Cite this

@article{64ac078b63e2409d9c680863625e3cb8,

title = "A Theorem on Reconstruction of Random Graphs",

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.",

author = "Cameron, {Peter J.} and Cleide Martins",

year = "1993",

month = jan,

day = "1",

doi = "10.1017/S0963548300000444",

language = "English",

volume = "2",

pages = "1--9",

journal = "Combinatorics, Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

T1 - A Theorem on Reconstruction of Random Graphs

AU - Cameron, Peter J.

AU - Martins, Cleide

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84971688511&partnerID=8YFLogxK

U2 - 10.1017/S0963548300000444

DO - 10.1017/S0963548300000444

M3 - Article

AN - SCOPUS:84971688511

SN - 0963-5483

VL - 2

SP - 1

EP - 9

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

IS - 1

ER -

A Theorem on Reconstruction of Random Graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this