English
Related papers

Related papers: Excluded minors for the Klein Bottle II. Cascades

200 papers

Diestel and Leader have characterised connected graphs that admit a normal spanning tree via two classes of forbidden minors. One class are Halin's $(\aleph_0,\aleph_1)$-graphs: bipartite graphs with bipartition $(\mathbb{N},B)$ such that…

Combinatorics · Mathematics 2017-10-05 Nathan Bowler , Stefan Geschke , Max Pitz

An immersion of a graph $H$ in a graph $G$ is a minimal subgraph $I$ of $G$ for which there is an injection ${{\rm i}} \colon V(H) \to V(I)$ and a set of edge-disjoint paths $\{P_e: e \in E(H)\}$ in $I$ such that the end vertices of…

A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The $\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an independently even…

Combinatorics · Mathematics 2022-10-03 Radoslav Fulek , Jan Kynčl

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

Combinatorics · Mathematics 2020-06-09 Suryaprakash Nagoji Rao

The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent…

Combinatorics · Mathematics 2019-03-21 Radoslav Fulek , Jan Kynčl

In this paper we prove two main results about obstruction to graph planarity. One is that, if $G$ is a 3-connected graph with a $K_5$-minor and $T$ is a triangle of $G$, then $G$ has a $K_5$-minor $H$, such that $E(T)\cont E(H)$. Other is…

Combinatorics · Mathematics 2013-04-23 João Paulo Costalonga

The central theorem of topological graph theory states that the graph minor relation is a well-quasi-order on graphs. It has far-reaching consequences, in particular in the study of graph structures and the design of (parameterized)…

Computational Geometry · Computer Science 2025-12-04 Corentin Lunel , Clément Maria

We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we…

Combinatorics · Mathematics 2023-08-16 Leonard Fowler , Gregory Li , Andrei Pavelescu

We prove that in the complement of a highly twisted link, all closed, essential, meridionally incompressible surfaces must have high genus. The genus bound is proportional to the number of crossings per twist region. A similar result holds…

Geometric Topology · Mathematics 2015-06-24 Ryan Blair , David Futer , Maggy Tomova

We construct higher genus Riemann's minimal surfaces properly embedded in the Euclidean space. To do that we glue end by end a Costa-Hoffman-Meeks examples to two halves genus zero Riemann's minimal surfaces. In first we need to perform a…

Differential Geometry · Mathematics 2007-05-23 Laurent Hauswirth , Frank Pacard

The current article continues our project on representation theory, Euler elements, causal homogeneous spaces and Algebraic Quantum Field Theory (AQFT). We call a pair (h,k) of Euler elements orthogonal if $e^{\pi i \ad h} k = -k$. We show…

Representation Theory · Mathematics 2025-08-18 Vincenzo Morinelli , Karl-Hermann Neeb , Gestur Olafsson

The pinched sphere is the pseudo-surface $\mathbb{S}^{\circ}_0$ obtained by identifying two distinct points of the sphere. We provide a structural characterization of graphs excluding an $\mathbb{S}^{\circ}_0$-embeddable graph as a minor.…

Combinatorics · Mathematics 2025-06-18 Laure Morelle , Evangelos Protopapas , Dimitrios M. Thilikos , Sebastian Wiederrecht

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower…

Combinatorics · Mathematics 2016-09-06 Kevin Cattell , Michael J. Dinneen , Michael R. Fellows

In this paper, we build properly embedded singly periodic minimal surfaces which have infinite total curvature in the quotient by the period. These surfaces are constructed by adding a handle to the toroidal half-plane layers defined by H.…

Differential Geometry · Mathematics 2007-05-23 Laurent Mazet

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

Discrete Mathematics · Computer Science 2018-03-22 Sérgio H. Nogueira , Vinicius F. dos Santos

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$…

Combinatorics · Mathematics 2017-03-13 Pavol Hell , César Hernández-Cruz , Cláudia Linhares Sales

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…

Metric Geometry · Mathematics 2020-08-06 Karim A. Adiprasito , Bruno Benedetti

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

Geometric Topology · Mathematics 2014-03-17 Scott Taylor , Maggy Tomova

We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…

Algebraic Topology · Mathematics 2018-01-08 Ahmad Zainy Al-Yasry

A theorem of Tutte states that every 4-connected non-hamiltonian graph contains $K_{3,3}$ as a minor. We strengthen this result by proving that such a graph must contain $K_{3,4}$ as a minor, thereby confirming a special case of a…

Combinatorics · Mathematics 2025-06-26 On-Hei Solomon Lo