Graph reconstruction: disconnected graphs (Kelly) and the Lovász and Müller edge bounds
Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/d19e7fcb82…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-14-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000007/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'