{"id":"hexagon/2610.00286","pdf":"https://hexagonmath.org/pdf/2610.00286v1","url":"https://hexagonmath.org/abs/2610.00286v1","tags":["msc:05C38","msc:05C70","Gallai's conjecture","Lean formalization","even-degree vertices","graph theory","path decomposition"],"score":0,"title":"Gallai's conjecture with two exceptional even vertices","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Idris Ali Shaik"],"reviews":0,"subject":"math.CO","summary":"Gallai conjectured that every connected finite simple graph on n vertices admits an edge partition into at most ⌈n/2⌉ simple paths. Botler and Sambinelli proved this when every even-degree vertex has at most three even neighbours. Fan, Hou and Zhou exempted one designated even vertex of positive degree and ensured that at least two paths ended there. Xie obtained the same endpoint conclusion for either of two adjacent designated even vertices, in separate partitions, when every other even vertex has at most three even neighbours. We prove that the same endpoint conclusion holds without…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-10-16","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":true,"formalizations":["https://palomar-registry.org/entry?id=PALOMAR-2026-10-04-000006&version=1"],"human_understanding":"all"}