{"id":"palomar/PALOMAR-2026-11-20-000007","url":"https://github.com/caiusdfolkerts/research/tree/2505d4b11cf6f2c7d34e58ff830b8ff71c3fb3d9/graphical_zonotopes_main_clean_status","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000007-v1.json","repo":"https://github.com/caiusdfolkerts/research","tags":["math.CO","math.MG","msc:52B11","msc:52B12","msc:05C10"],"score":0,"title":"Sharp bounds for indecomposable graphical-zonotope summands: main","trust":"high","domain":"math.CO","source":"palomar","authors":["Caius Folkerts"],"reviews":0,"subject":"math.CO","summary":"Principal path construction and simultaneous sharp bounds; exact 3-tree, clique-book, multipartite and lattice classifications. It also constructs, for every n ≥ 10, K5-free graphs of treewidth four with 3n − 5 edges supporting full-dimensional lattice indecomposable polytopal summands; no proper edge-subgraph supports a full-dimensional indecomposable polytopal weak summand.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-20","reactions":{},"formalized":true,"formalizes":[{"title":"Sharp bounds for indecomposable summands of graphical zonotopes","identifier":"","relationship":"formalizes"}]}