English
Related papers

Related papers: Thin position and planar surfaces for graphs in th…

200 papers

We prove that if a complete Riemannian surface $(\Sigma,d_\Sigma)$ is quasi-isometric to some bounded degree graph $G$, then $\Sigma$ admits a triangulation whose 1-skeleton is quasi-isometric to it when equipped with the simplicial metric.…

Metric Geometry · Mathematics 2026-05-19 Agelos Georgakopoulos , Federico Vigolo

We describe some of the algebra underlying the decomposition of planar grid diagrams. This provides a useful toy model for an extension of Heegaard Floer homology to 3-manifolds with parametrized boundary. This paper is meant to serve as a…

Geometric Topology · Mathematics 2010-04-08 Robert Lipshitz , Peter Ozsvath , Dylan Thurston

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Group Theory · Mathematics 2023-07-25 Reymond Akpanya , Tom Goertzen

A graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.

Combinatorics · Mathematics 2022-10-05 Y. Gu , H. A. Kierstead , Sang-il Oum , Hao Qi , Xuding Zhu

Tropical caustic of a convex domain on the plane is a canonically associated tropical analytic curve inside the domain. In this note we give a graphical proof for the classification of its intermediate vertices, implying in particular that…

Algebraic Geometry · Mathematics 2025-10-03 Mikhail Shkolnikov

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

Geometric Topology · Mathematics 2022-09-23 Jacob Russell , Kate M. Vokes

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…

Geometric Topology · Mathematics 2010-05-12 Emil Saucan , Meir Katchalski

In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…

Combinatorics · Mathematics 2016-12-02 Ginji Hamano

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked…

Geometric Topology · Mathematics 2007-07-25 Chris Cicotta , Joel Foisy , Tom Reilly , Sara Revzi , Ben Wang , Alice Wilson

In the minimal surface theory, the Krust theorem asserts that if a minimal surface in the Euclidean 3-space $\mathbb{E}^3$ is the graph of a function over a convex domain, then each surface of its associated family is also a graph. The same…

Differential Geometry · Mathematics 2022-04-06 Shintaro Akamine , Hiroki Fujino

We show that in any triangulated 3-manifold, every index n topologically minimal surface can be transformed to a surface which has local indices (as computed in each tetrahedron) that sum to at most n. This generalizes classical theorems of…

Geometric Topology · Mathematics 2012-10-18 David Bachman

In this note we give a short and elementary proof of a more general version of Whitney's theorem that 3-connected planar graphs have a unique embedding in the plane. A consequence of the theorem is that cubic plane graphs cannot be embedded…

Combinatorics · Mathematics 2020-06-04 Gunnar Brinkmann

Let $f\in W^{3,1}_{\mathrm{loc}}(\Omega)$ be a function defined on a connected open subset $\Omega\subseteq\mathbb R^2$. We will show that its graph is contained in a quadratic surface if and only if $f$ is a weak solution to a certain…

Analysis of PDEs · Mathematics 2026-01-16 Bartłomiej Zawalski

These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…

Probability · Mathematics 2012-03-07 Richard Kenyon

The restricted planar three-body problem has a rich history, yet many unanswered questions still remain. In the present paper we prove the existence of a global surface of section near the smaller body in a new range of energies and mass…

Symplectic Geometry · Mathematics 2012-08-13 Peter Albers , Joel W. Fish , Urs Frauenfelder , Helmut Hofer , Otto van Koert

A canonical branched covering over each sufficiently good simplicial complex is constructed. Its structure depends on the combinatorial type of the complex. In this way, each closed orientable 3-manifold arises as a branched covering over…

Geometric Topology · Mathematics 2007-05-23 Ivan Izmestiev , Michael Joswig

If a one-variable function is sufficiently smooth, then the limit position of secant lines its graph is a tangent line. By analogy, one would expect that the limit position of secant planes of a two-variable smooth function is a plane…

Differential Geometry · Mathematics 2022-08-30 Paolo Roselli

We construct a weakly complete flat surface in hyperbolic 3-space having a pair of hyperbolic Gauss maps both of whose images are contained in an arbitrarily given open disc in the ideal boundary of H^3. This construction is accomplished as…

Differential Geometry · Mathematics 2012-05-23 Francisco Martin , Masaaki Umehara , Kotaro Yamada

We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…

Combinatorics · Mathematics 2018-10-15 Ioannis Ivrissimtzis , Norbert Peyerimhoff , Alina Vdovina

We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.

Combinatorics · Mathematics 2007-12-28 Alexander Kelmans
‹ Prev 1 8 9 10 Next ›