Reconstructing the degree sequence of a sparse graph from a partial deck

The deck of a graph $G$ is the multiset of cards $\{G-v:v\in V(G)\}$. Myrvold (1992) showed that the degree sequence of a graph on $n\geq7$ vertices can be reconstructed from any deck missing one card. We prove that the degree sequence of a graph with average degree $d$ can reconstructed from any deck missing $O(n/d^3)$ cards. In particular, in the case of graphs that can be embedded on a fixed surface (e.g. planar graphs), the degree sequence can be reconstructed even when a linear number of the cards are missing.

[1]  S. Ulam.  A collection of mathematical problems , 1960 .

[2]  J. Lauri,et al.  Topics in Graph Automorphisms and Reconstruction , 2003 .

[3]  Wendy Myrvold.  Ally and adversary reconstruction problems , 1988 .

[4]  Alex Scott,et al.  Size reconstructibility of graphs , 2018, J. Graph Theory.

[5]  Wendy J. Myrvold.  The degree sequence is reconstructible from n-1 cards , 1992, Discret. Math..

[6]  Paul Brown,et al.  The size of a graph is reconstructible from any n-2 cards , 2018, Discret. Math..

[7]  William R B Lionheart,et al.  The Reconstruction Problem , 2017 .

[8]  P. Kelly.  A congruence theorem for trees. , 1957 .

[9]  Paul Brown,et al.  Families of pairs of graphs with a large number of common cards , 2010, J. Graph Theory.

[10]  Václav Nýdl,et al.  Finite undirected graphs which are not reconstructible from their large cardinality subgraphs , 1992, Discret. Math..

[11]  Robert L. Hemminger,et al.  Graph reconstruction - a survey , 1977, J. Graph Theory.

[12]  William B. Giles.  The reconstruction of outerplanar graphs , 1974 .

[13]  Xingxing Yu,et al.  On the reconstruction of planar graphs , 2007, J. Comb. Theory, Ser. B.

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  Josef Lauri.  The reconstruction of maximal planar graphs II. Reconstruction , 1981, J. Comb. Theory, Ser. B.

[16]  J. A. Bondy,et al.  Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .

[17]  Paul Brown,et al.  Recognizing connectedness from vertex‐deleted subgraphs , 2011, J. Graph Theory.

[18]  Wendy Myrvold,et al.  A survey of some open questions in reconstruction numbers , 2010, Ars Comb..