{"id":"openai-math/L1-Embeddings-of-Graphs-of-Bounded-Treewidth","pdf":"https://github.com/openai/math/blob/main/preprints/L1-Embeddings-of-Graphs-of-Bounded-Treewidth-September-23-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/L1-Embeddings-of-Graphs-of-Bounded-Treewidth-September-23-2026","tags":["metric-embeddings","graph-theory","treewidth"],"score":0,"title":"L1 Embeddings of Graphs of Bounded Treewidth","domain":"Convex and metric geometry","family":"089","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.MG","summary":"For every fixed treewidth bound, the shortest-path metrics of finite connected graphs with arbitrary positive real edge lengths embed into real L 1 with uniformly bounded distortion. This resolves the bounded-treewidth case of the Gupta–Newman–Rabinovich–Sinclair conjecture positively.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-09-23","reactions":{},"formalized":true,"family_title":"Bounded-distortion L 1 embeddings of planar and bounded-treewidth graphs"}