2018/07/31 by Groenland, Carla, Guggiari, Hannah, Scott, Alex
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1807.11733
The deck of a graph G is given by the multiset of (unlabelled) subgraphs \G-v:v∈ V(G)\. The subgraphs G-v are referred to as the cards of G. Brown and Fenner recently showed that, for n≥29, the number of edges of a graph G can be computed from any deck missing 2 cards. We show that, for sufficiently large n, the number of edges can be computed from any deck missing at most \frac120√(n) cards.