Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.01724v5

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.01724v5 (math)
[Submitted on 2 Jun 2023 (v1) , last revised 26 Feb 2025 (this version, v5)]

Title: The Graph Minors Structure Theorem through Bidimensionality

Title: 通过分治性的图极小结构定理

Authors:Dimitrios M. Thilikos, Sebastian Wiederrecht
Abstract: The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor some $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST) that avoids the use of apices and vortices: $K_k$-minor free graphs are those that admit tree-decompositions whose torsos contain sets of bounded bidimensionality whose removal yield a graph embeddable in some surface $\Sigma$ of bounded Euler-genus. We next fix the target condition by demanding that $\Sigma$ is some particular surface. This defines a "surface extension" of treewidth, where $\Sigma\mbox{-}\textsf{tw}(G)$ is the minimum $k$ for which $G$ admits a tree-decomposition whose torsos become embeddable embeddable in $\Sigma$ after the removal of a set of dimensionality at most $k$. We identify a finite collection $\mathfrak{D}_{\Sigma}$ of parametric graphs and prove that the minor-exclusion of the graphs in $\mathfrak{D}_{\Sigma}$ determines the behavior of ${\Sigma}\mbox{-}\textsf{tw}$, for every surface $\Sigma.$ It follows that the collection $\mathfrak{D}_{\Sigma}$ bijectively corresponds to the "surface obstructions" for $\Sigma,$ i.e., surfaces that are minimally non-contained in $\Sigma.$ Our results are tight in the sense that ${\Sigma}\mbox{-}\textsf{tw}$ cannot be bounded for all parametric graphs in $\mathfrak{D}_{\Sigma}$.
Abstract: 一个图 $G$ 中顶点集合 $X$ 的双维性是最大的 $k$ ,使得 $G$ 包含某个 $(k \times k)$-网格作为 $X$-根的子式。 这种概念允许以下避免使用尖点和涡旋的图极小结构定理(GMST)版本:$K_k$-不可约图是那些具有树分解的图,其每个部分包含有界双维性的集合,移除这些集合后得到的图可以嵌入到某个有界欧拉- genus 的表面上$\Sigma$。我们接下来通过要求$\Sigma$是某个特定的表面来确定目标条件。 这定义了树宽的“表面扩展”,其中$\Sigma\mbox{-}\textsf{tw}(G)$是最小的$k$,使得$G$可以进行树分解,其身体在移除一个维数至多为$k$的集合后可以嵌入到$\Sigma$中。 我们确定了一个有限的参数图集合$\mathfrak{D}_{\Sigma}$,并证明集合$\mathfrak{D}_{\Sigma}$中图的 minor 排除决定了${\Sigma}\mbox{-}\textsf{tw}$在每个曲面$\Sigma.$上的行为。由此可知,集合$\mathfrak{D}_{\Sigma}$与“曲面障碍”对于$\Sigma,$一一对应,即那些在$\Sigma.$中最小不包含的曲面。我们的结果是紧致的,因为${\Sigma}\mbox{-}\textsf{tw}$无法被所有参数图中的$\mathfrak{D}_{\Sigma}$所限制。
Comments: We split the article into two volumes. The first volume, concerned with extracting surfaces from the GMST, has become the new version of this article, while the second volume will be a different upload. arXiv admin note: text overlap with arXiv:2304.04517
Subjects: Combinatorics (math.CO)
MSC classes: 05C10, 05C83, 05C75, 68R10
ACM classes: G.2.2
Cite as: arXiv:2306.01724 [math.CO]
  (or arXiv:2306.01724v5 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.01724
arXiv-issued DOI via DataCite

Submission history

From: Dimitrios Thilikos [view email]
[v1] Fri, 2 Jun 2023 17:50:10 UTC (2,244 KB)
[v2] Fri, 14 Jul 2023 12:52:04 UTC (4,767 KB)
[v3] Wed, 28 Feb 2024 07:42:48 UTC (1,526 KB)
[v4] Tue, 24 Dec 2024 08:30:43 UTC (1,486 KB)
[v5] Wed, 26 Feb 2025 15:14:47 UTC (734 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号