Excluding Pinched Spheres
Laure Morelle, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht

TL;DR
This paper characterizes graphs excluding a specific pinched sphere-embeddable minor, providing a structural decomposition related to bidimensionality and embeddability in the projective plane, with implications for edge-apex graphs.
Contribution
It introduces a structural characterization of graphs excluding a pinched sphere minor, linking bidimensionality, tree decompositions, and embeddability in the projective plane.
Findings
Graphs excluding an $ ext{S}^ ext{o}_0$-embeddable minor have bounded bidimensionality in their tree decompositions.
Such graphs can be reduced to graphs embeddable in the projective plane by vertex identification.
Edge-apex graphs are characterized as graphs embeddable in the pinched sphere.
Abstract
The pinched sphere is the pseudo-surface obtained by identifying two distinct points of the sphere. We provide a structural characterization of graphs excluding an -embeddable graph as a minor. Given a graph and a vertex set , the bidimensionality of in is the maximum such that contains the -grid as an -rooted minor, i.e., there exists a minor model of the -grid in~ such that every branchset of this model contains a vertex of . We prove that there is a function~ such that, if a graph excludes an -embeddable graph as a minor, has a tree decomposition where each torso contains some set of vertices whose bidimensionality in is at most such that can be reduced to a graph embeddable in the projective plane by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArchitecture and Computational Design
