English
Related papers

Related papers: K5 and K3,3 are Toroidal Penny Graphs

200 papers

We investigate properties of sparse and tight surface graphs. In particular we derive topological inductive constructions for $(2, 2)$-tight surface graphs in the case of the sphere, the plane, the twice punctured sphere and the torus. In…

Combinatorics · Mathematics 2021-03-09 James Cruickshank , Derek Kitson , Stephen C. Power , Qays Shakir

We present enumerations of a class of toroidal graphs which give rise to semi-equivelar maps. There are eleven different types of semi-equivelar maps on the torus. These are of the types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$, $\{3^{3},…

Combinatorics · Mathematics 2017-05-05 Dipendu Maity , Ashish Kumar Upadhyay

A 1-planar graph refers to a graph that can be drawn on the plane such that each edge has at most one crossing. In this paper, focusing on the spectral Tur\'{a}n-type problems of $1$-planar graphs, we determine completely the unique…

Combinatorics · Mathematics 2025-12-16 Weilun Xu , An Chang

The well known Wagner's theorem states that a graph is a planar graph if and only if it is $K_5$-minor-free and $K_{3,3}$-minor-free. Denote by $AT(G)$ the Alon-Tarsi number of a graph $G$. We show that for any $K_{3,3}$-minor-free graph…

Combinatorics · Mathematics 2023-10-17 Leyou Xu , Bo Zhou

Cameron and Kazanidis have recently shown that rank-3 graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of…

Combinatorics · Mathematics 2008-06-10 Chris Godsil , Gordon F. Royle

The Colin de Verdiere number of graph G, denoted by \mu(G), is a spectral invariant of G that is related to some of its topological properties. For example, \mu(G) \leq 3 iff G is planar. A penny graph is the contact graph of equal-radii…

Metric Geometry · Mathematics 2020-06-11 A. Y. Alfakih

We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…

Number Theory · Mathematics 2017-04-21 James Stankewicz

In this note, we give a proof of the fact that we can efficiently find degree-3 planar graphs as topological minors of sufficiently large wall graphs. The result is needed as an intermediate step to fix a proof in my PhD thesis.

Discrete Mathematics · Computer Science 2023-02-23 Antoine Amarilli

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than $k$ times. In this paper, we explore the relationship between $k$-planarity and…

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…

Combinatorics · Mathematics 2023-06-22 Kengo Enami

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of…

Geometric Topology · Mathematics 2008-07-21 Tao Li

We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…

Combinatorics · Mathematics 2020-04-24 Semin Yoo

A graph is $k$-planar $(k \geq 1)$ if it can be drawn in the plane such that no edge is crossed more than $k$ times. A graph is $k$-quasi planar $(k \geq 2)$ if it can be drawn in the plane with no $k$ pairwise crossing edges. The families…

For a graph $H$ and a $k$-chromatic graph $F,$ if the Tur\'an graph $T_{k-1}(n)$ has the maximum number of copies of $H$ among all $n$-vertex $F$-free graphs (for $n$ large enough), then $H$ is called $F$-Tur\'an-good, or $k$-Tur\'an-good…

Combinatorics · Mathematics 2021-02-03 Bingchen Qian , Chengfei Xie , Gennian Ge

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

Geometric Topology · Mathematics 2014-10-01 Erica Flapan , Blake Mellor , Ramin Naimi

We study the problem of finding, for a given one-dimensional topological space $X$, a cover of $X$ of smallest size by geodesics with respect to some metric. The infimal size of such a set is called the metric geodesic cover number of $X$.…

Metric Geometry · Mathematics 2026-02-13 Jerry Chen , Kyle Hess , Matthew Romney

In this paper we study the automorphisms group of some K3 surfaces which are double covers of the projective plane ramified over a smooth sextic plane curve. More precisely, we study some particlar case of a K3 surface of Picard rank two.

Algebraic Geometry · Mathematics 2007-05-23 Federica Galluzzi , Giuseppe Lombardo

This paper's theme is the relation between several classical and well-known objects: triangle Fuchsian groups, quasi-homogeneous singularities of plane curves, torus knot complements in the 3-sphere. Torus knots are the only nontrivial…

Geometric Topology · Mathematics 2013-08-28 Valdemar V. Tsanov

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