Id: palomar/PALOMAR-2026-11-14-000010 Url: https://github.com/VictorLiwentao/fc-palomar-proofs/tree/b452164b17ccd6ed00110e9610a3cc023611d326 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000010-v1.json Repo: https://github.com/VictorLiwentao/fc-palomar-proofs Tags: math.CO, msc:05C70, msc:05C35 Score: 0 Title: The Sauer–Spencer packing theorem 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=Edge disjoint placement of graphs identifier=doi:10.1016/0095-8956(78)90005-1 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-14-000010 Two graphs on the same n vertices pack if 2 Δ(G1) Δ(G2) < n (Sauer and Spencer 1978).