{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"A congruence theorem for trees","identifier":"doi:10.2140/pjm.1957.7.961","relationship":"formalizes"},{"title":"A note on the line reconstruction problem","identifier":"doi:10.1016/0095-8956(72)90064-3","relationship":"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"}]}