Output details
11 - Computer Science and Informatics
Birkbeck College
Article title
Families of pairs of graphs with a large number of common cards
Type
D - Journal article
Title of journal
Journal of Graph Theory
Article number
-
Volume number
63
Issue number
2
First page of article
146
ISSN of journal
10970118
Year of publication
2010
URL
-
Number of additional authors
2
Additional information
<13> 20 years ago an extension of the 60-year-old Reconstruction Conjecture claimed that any graph could be reconstructed from any subset of about 1/2 of its cards. In this paper this conjecture is disproved by showing that about 2/3 of the cards may be necessary, and it is conjectured that this is also sufficient. The paper referees wrote: "the first paper containing substantial results about the universal reconstruction number...will be a main point of reference for anyone wanting to research universal reconstruction numbers", "The results...provide new insight to the reconstruction problem".
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Computational Intelligence
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
