English
Related papers

Related papers: The maximum and minimum genus of a multibranched s…

200 papers

In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus $g\geq 1$ and $m\geq 1$ ideal boundary components. We show that the width for the area functional can be achieved by a bubble tree limit…

Differential Geometry · Mathematics 2022-03-15 Yuchin Sun

We say that a $2$-dimensional CW complex is a multibranched surface if we remove all points whose open neighborhoods are homeomorphic to the $2$-dimensional Euclidean space, then we obtain a $1$-dimensional complex which is homeomorphic to…

Geometric Topology · Mathematics 2016-03-31 Shosaku Matsuzaki , Makoto Ozawa

Let N be a closed irreducible 3-manifold and assume N is not a graph manifold. We improve for all but finitely many S^1-bundles M over N the adjunction inequality for the minimal complexity of embedded surfaces. This allows us to completely…

Geometric Topology · Mathematics 2018-12-24 Stefan Friedl , Stefano Vidussi

The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree $\Delta(G)$…

Combinatorics · Mathematics 2016-04-25 Andrei Gagarin , Vadim Zverovich

We establish general bounds on the topology of free boundary minimal surfaces obtained via min-max methods in compact, three-dimensional ambient manifolds with mean convex boundary. We prove that the first Betti number is lower…

Differential Geometry · Mathematics 2026-01-22 Giada Franz , Mario B. Schulz

The maximum genus $\gamma_M(G)$ of a graph G is the largest genus of an orientable surface into which G has a cellular embedding. Combinatorially, it coincides with the maximum number of disjoint pairs of adjacent edges of G whose removal…

Combinatorics · Mathematics 2015-01-30 Michal Kotrbcik , Martin Skoviera

We establish a general min-max type theorem that produces minimal surfaces with prescribed genus in 3-manifolds with positive Ricci curvature. An important intermediate step is to show that, in a generic metric with positive Ricci…

Differential Geometry · Mathematics 2026-05-01 Adrian Chun-Pong Chu , Yangyang Li , Zhihan Wang

In this paper we prove genus bounds for closed embedded minimal surfaces in a closed 3-dimensional manifold constructed via min-max arguments. A stronger estimate was announced by Pitts and Rubistein but to our knowledge its proof has never…

Analysis of PDEs · Mathematics 2009-05-26 Camillo De Lellis , Filippo Pellandini

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

Combinatorics · Mathematics 2011-12-16 Daniel Heldt , Kolja Knauer , Torsten Ueckerdt

Let $G=(V,E)$ be a multigraph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\frac{3}{2}\Delta$ colors by Shannon's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$…

Data Structures and Algorithms · Computer Science 2013-09-25 Michał Farnik , Łukasz Kowalik , Arkadiusz Socała

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

Combinatorics · Mathematics 2019-03-22 Ilkyoo Choi , Ringi Kim , Alexandr Kostochka , Boram Park , Douglas B. West

We prove an enumerative min-max theorem that relates the number of genus g minimal surfaces in 3-manifolds of positive Ricci curvature to topological properties of the set of embedded surfaces of genus $\leq g$, possibly with finitely many…

Differential Geometry · Mathematics 2026-01-06 Adrian Chun-Pong Chu , Yangyang Li , Zhihan Wang

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…

Geometric Topology · Mathematics 2017-10-26 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…

Geometric Topology · Mathematics 2023-11-27 Lorena Armas-Sanabria , Víctor Núñez

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…

Geometric Topology · Mathematics 2025-12-03 Biplab Basak , Sourav Sarkar

An estimate for the genus function in circle bundles over irreducible 3-manifolds is proven. This estimate is in many cases an equality and it relates the minimal genus of the surfaces representing a given homology class with the…

Geometric Topology · Mathematics 2018-11-07 Matthias Nagel

This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , J. Hyam Rubinstein , Shicheng Wang

The \emph{total graph} $T(G)$ of a multigraph $G$ has as its vertices the set of edges and vertices of $G$ and has an edge between two vertices if their corresponding elements are either adjacent or incident in $G$. We show that if $G$ has…

Combinatorics · Mathematics 2015-08-06 Daniel W. Cranston

The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…

Combinatorics · Mathematics 2008-09-09 Vida Dujmovic' , Matthew Suderman , David R. Wood

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Combinatorics · Mathematics 2015-12-14 Eran Nevo , Guillermo Pineda-Villavicencio , David R. Wood
‹ Prev 1 2 3 10 Next ›