Id: palomar/PALOMAR-2026-11-14-000007 Url: https://github.com/VictorLiwentao/fc-palomar-proofs/tree/d19e7fcb821eaaa86bee1c9415343dc034cd5ed5 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000007-v1.json Repo: https://github.com/VictorLiwentao/fc-palomar-proofs Tags: math.CO, msc:05C60 Score: 0 Title: Graph reconstruction: disconnected graphs (Kelly) and the Lovász and Müller edge bounds Trust: high Domain: math.CO Source: palomar Authors: Wentao Li Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-14 Formalized: true Formalizes: title=A congruence theorem for trees identifier=doi:10.2140/pjm.1957.7.961 relationship=formalizes Formalizes: title=A note on the line reconstruction problem identifier=doi:10.1016/0095-8956(72)90064-3 relationship=formalizes Formalizes: title=The edge reconstruction hypothesis is true for graphs with more than n log2 n edges identifier=doi:10.1016/0095-8956(77)90039-1 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-14-000007 Three classical reconstruction theorems: a disconnected graph on at least three vertices is determined by its vertex deck (Kelly 1957); a graph with m > C(n,2)/2 edges (Lovász 1972) or with n! < 2^(m−1) (Müller 1977) is determined by its edge deck.