← 研踪 PaperTrailarXiv:2611.11513 · v1
Induced-Minor-Free Graphs Admit a Star-Based Separator of Size $\tilde{O}(\sqrt{n})$
首次提交 2026-11-09 01:38
版本更新 2026-11-09 01:38
雷达观测 2026-11-10 13:19
摘要
Given an -induced-minor-free graph with vertices, we construct a balanced separator of consisting of star subgraphs. Our result is an induced-minor-free analog of the famous separator theorem for -minor-free graphs by Alon, Seymour, and Thomas [J. Amer. Math. Soc., 1990]. A key idea in our construction is a new decomposition of -induced-minor-free graphs, analogous to the cop decomposition for -minor-free graphs by Andreae [J. Combin. Theory Ser. B, 1986]. We also discuss several algorithmic applications of our result.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-09 01:38 · 最新观测版本
Induced-Minor-Free Graphs Admit a Star-Based Separator of Size $\tilde{O}(\sqrt{n})$
Given an -induced-minor-free graph with vertices, we construct a balanced separator of consisting of star subgraphs. Our result is an induced-minor-free analog of the famous separator theorem for -minor-free graphs by Alon, Seymour, and Thomas [J. Amer. Math. Soc., 1990]. A key idea in our construction is a new decomposition of -induced-minor-free graphs, analogous to the cop decomposition for -minor-free graphs by Andreae [J. Combin. Theory Ser. B, 1986]. We also discuss several algorithmic applications of our result.
查看此版本解读 →查看此版本原文 ↗