{"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","summary":"Two graphs on the same n vertices pack if 2 Δ(G1) Δ(G2) < n (Sauer and Spencer 1978).","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"Edge disjoint placement of graphs","identifier":"doi:10.1016/0095-8956(78)90005-1","relationship":"formalizes"}]}