English
Related papers

Related papers: Index 3 biembeddings of the complete graphs

200 papers

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

Combinatorics · Mathematics 2010-01-19 Jin Ho Kwak , Young Soo Kwon

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

Combinatorics · Mathematics 2022-06-28 Abigail Thompson

We construct examples of flat surfaces in $\mathbb{H}^3$ which are graphs over a two-punctured horosphere and classify complete embedded flat surfaces in $\mathbb{H}^3$ with only one end and at most two isolated singularities.

Differential Geometry · Mathematics 2009-05-15 Armando V. Corro , Antonio Martinez , Francisco Milan

Those maps of a closed surface to the three-dimensional torus that are homotopic to embeddings are characterized. Particular attention is paid to the somewhat intricate case when the surface is nonorientable.

Geometric Topology · Mathematics 2007-05-23 Allan L. Edmonds

Let $\Sigma$ denote a closed surface with constant mean curvature in $\mathbb{G}^3$, a 3-dimensional Lie group equipped with a bi-invariant metric. For such surfaces, there is a harmonic Gauss map which maps values to the unit sphere within…

Differential Geometry · Mathematics 2026-01-22 Alcides de Carvalho , Marcos P. Cavalcante , Wagner Costa-Filho , Darlan de Oliveira

We prove that a surface carries a hexagonal 3-web of geodesics if and only if the geodesic flow on the surface admits a cubic first integral and show that the system of partial differential equations, governing metrics on such surfaces, is…

Differential Geometry · Mathematics 2019-03-05 Sergey I. Agafonov

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Combinatorics · Mathematics 2016-09-06 Neil Robertson , Paul Seymour , Robin Thomas

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…

Combinatorics · Mathematics 2008-12-16 Sergei Chmutov

Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…

Complex Variables · Mathematics 2016-07-22 Neil Strickland

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

Combinatorics · Mathematics 2022-11-08 Oliver Bachtler , Sven O. Krumke

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

General Mathematics · Mathematics 2009-09-29 Linfan Mao , Yanpei Liu , Feng Tian

In this paper we study embeddings of oriented connected closed surfaces in $\mathbb S^3$. We define a complete invariant, the fundamental span, for such embeddings, generalizing the notion of the peripheral system of a knot group. From the…

Geometric Topology · Mathematics 2021-05-25 Giovanni Bellettini , Maurizio Paolini , Yi-Sheng Wang

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

Geometric Topology · Mathematics 2013-03-28 David Bachman

Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially…

Group Theory · Mathematics 2019-02-13 G. Christopher Hruska , Hoang Thanh Nguyen

A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the…

Combinatorics · Mathematics 2023-05-24 Warren Singh , Timothy Sun

We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of…

Geometric Topology · Mathematics 2007-05-23 V. Kurlin

Dimofte, Gaiotto and Gukov introduced a powerful invariant, the 3D-index, associated to a suitable ideal triangulation of a 3-manifold with torus boundary components. The 3D-index is a collection of formal power series in $q^{1/2}$ with…

Geometric Topology · Mathematics 2016-04-12 Stavros Garoufalidis , Craig Hodgson , Neil Hoffman , Hyam Rubinstein

An embedding of a graph in $3$-space is linkless if for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. We prove that every bipartite linklessly embeddable (simple)…

Combinatorics · Mathematics 2020-01-01 Rose McCarty , Robin Thomas

We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…

Combinatorics · Mathematics 2011-11-09 Noga Alon , Ankur Moitra , Benny Sudakov