English
Related papers

Related papers: Index 3 biembeddings of the complete graphs

200 papers

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…

Combinatorics · Mathematics 2024-11-19 E. Alkin , E. Bordacheva , A. Miroshnikov , O. Nikitenko , A. Skopenkov

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

Every embedded surface $\mathcal{K}$ in the 4-sphere admits a bridge trisection, a decomposition of $(S^4,\mathcal{K})$ into three simple pieces. In this case, the surface $\mathcal{K}$ is determined by an embedded 1-complex, called the…

Geometric Topology · Mathematics 2024-09-20 Jeffrey Meier , Abigail Thompson , Alexander Zupan

In a Type III degeneration of K3-surfaces the dual graph of the central fibre is a triangulation of the 2-sphere. We realise the tetrahedral, octahedral and especially the icosahedral triangulation in families of K3-surfaces, preferably…

Algebraic Geometry · Mathematics 2007-05-23 Jan Stevens

We prove that for every complete multipartite graph $F$ there exist very dense graphs $G_n$ on $n$ vertices, namely with as many as ${n\choose 2}-cn$ edges for all $n$, for some constant $c=c(F)$, such that $G_n$ can be decomposed into…

Combinatorics · Mathematics 2015-01-16 Csilla Bujtás , Zsolt Tuza

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Geometric Topology · Mathematics 2016-06-03 Dmitry Tonkonog

It is shown that every complete n-vertex simple topological graph has at least Omega(n^{1/3}) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and T\'oth.

Combinatorics · Mathematics 2012-08-16 Andrew Suk

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Combinatorics · Mathematics 2023-11-17 Stefan Gyurki , Sona Pavlikova , Jozef Siran

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

Combinatorics · Mathematics 2019-01-30 Gennaro Amendola

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

Geometric Topology · Mathematics 2018-08-14 Erica Flapan , Nicole Lehle , Blake Mellor , Matt Pittluck , Xan Vongsathorn

We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible…

Data Structures and Algorithms · Computer Science 2014-04-15 Stephen Alstrup , Haim Kaplan , Mikkel Thorup , Uri Zwick

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…

Geometric Topology · Mathematics 2014-09-11 Dongseok Kim

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…

Combinatorics · Mathematics 2022-05-05 Jie Han

We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…

Combinatorics · Mathematics 2023-03-31 Johannes Carmesin , Tsvetomir Mihaylov

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…

Combinatorics · Mathematics 2009-11-17 M. N. Ellingham , Xiaoya Zha

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are regarded as disjoint unions of two subsets of the ground set {1,...,t} of the…

Combinatorics · Mathematics 2020-08-25 Andrey O. Matveev

A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…

Discrete Mathematics · Computer Science 2025-07-02 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl

Let M be a compact connected orientable 3-manifold, with non-empty boundary that contains no 2-spheres. We investigate the existence of two properly embedded disjoint surfaces S_1 and S_2 such that M - (S_1 \cup S_2) is connected. We show…

Geometric Topology · Mathematics 2012-09-17 Marc Lackenby

We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.

Geometric Topology · Mathematics 2007-05-23 Paul Norbury , J. Hyam Rubinstein