English
Related papers

Related papers: A Whitney type theorem for surfaces: characterisin…

200 papers

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

Combinatorics · Mathematics 2017-03-02 Jakub Przybyło

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such…

Geometric Topology · Mathematics 2020-04-29 Darlan Girão , Jessica S. Purcell

A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$, the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$. Locally complete 2-edge-coloured graphs have nice…

Combinatorics · Mathematics 2024-10-08 Jørgen Bang-Jensen , Jing Huang

For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…

Geometric Topology · Mathematics 2025-10-21 Senja Barthel , Fabio Buccoliero

A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…

Computational Geometry · Computer Science 2016-09-01 Radoslav Fulek , Michael Pelsmajer , Marcus Schaefer

For automorphisms of a polynomial ring in two variables over a domain R, we show that local tameness implies global tameness provided that every 2-generated invertible R-module is free. We give many examples illustrating this property.

Algebraic Geometry · Mathematics 2010-11-04 Joost Berson , Adrien Dubouloz , Jean-Philippe Furter , Stefan Maubach

A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…

Combinatorics · Mathematics 2020-01-27 Igor Fabrici , Jochen Harant , Tomáš Madaras , Samuel Mohr , Roman Soták , Carol T. Zamfirescu

In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…

Combinatorics · Mathematics 2015-09-28 Omid Amini , Louis Esperet , Jan van den Heuvel

Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…

Computational Geometry · Computer Science 2007-05-23 C. Erten , S. G. Kobourov

We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…

Discrete Mathematics · Computer Science 2023-05-12 Cyril Gavoille , Claire Hilaire

Let $G$ be a graph embedded in a surface and let $\mathcal F$ be a set of even faces of $G$ (faces bounded by a cycle of even length). The resonance graph of $G$ with respect to $\mathcal F$, denoted by $R(G;\mathcal F)$, is a graph such…

Combinatorics · Mathematics 2023-06-16 Niko Tratnik , Dong Ye

Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…

Probability · Mathematics 2021-10-27 Itai Benjamini , Adam Timar

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Geometric Topology · Mathematics 2019-05-06 Senja Barthel

We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…

Combinatorics · Mathematics 2012-09-11 Eric Katz

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…

Combinatorics · Mathematics 2015-01-07 Steven Schluchter

The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…

Computational Geometry · Computer Science 2016-05-06 Radoslav Fulek

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

We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…

Differential Geometry · Mathematics 2016-11-24 William H. Meeks , Joaquin Perez , Antonio Ros

The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of F\'{a}ry's theorem to surfaces equipped with…

Computational Geometry · Computer Science 2017-08-29 Alfredo Hubard , Vojtěch Kaluža , Arnaud de Mesmay , Martin Tancer

We give graphical presentations for the two quantum subgroups of type $G_2$. To do this we use a method of extending a tensor category by embedding the planar algebra of a $\otimes$-generating object into the graph planar algebra of this…

Quantum Algebra · Mathematics 2026-01-12 Caleb Kennedy Hill