English
Related papers

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

200 papers

The Kuratowski-Wagner Theorem asserts that a graph is planar if and only if it does not have either $K_{3,3}$ or $K_5$ as a minor. Using this Wagner obtained a precise description of all graphs with no $K_{3,3}$ minor and all graphs with no…

Combinatorics · Mathematics 2018-11-06 Matt DeVos , Mahdieh Malekian

We investigate the structure of the tri-pants graph, a simplicial graph introduced by Maloni and Palesi, whose vertices correspond to particular collections of homotopy classes of simple closed curves of the twice-punctured torus, called…

Geometric Topology · Mathematics 2021-11-16 Katherine Betts , Troy Larsen , Jeffrey Utley , Avalon Vanis

Motivated by an analogous result for K3 models, we classify all groups of symmetries of non-linear sigma models on a torus T^4 that preserve the N=(4,4) superconformal algebra. The resulting symmetry groups are isomorphic to certain…

High Energy Physics - Theory · Physics 2015-06-19 Roberto Volpato

Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no $K_{3,3}$-subdivisions that coincide with the toroidal graphs with no $K_{3,3}$-minors. These graphs admit a unique decomposition…

Combinatorics · Mathematics 2010-12-22 Andrei Gagarin , Wendy Myrvold , John Chambers

Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are…

Combinatorics · Mathematics 2025-03-11 Stephen Bartell , Paul Seymour

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

Discrete Mathematics · Computer Science 2015-03-17 Vahan V. Mkrtchyan , Petros A. Petrosyan

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We…

Combinatorics · Mathematics 2021-03-08 Frank Göring , Tobias Hofmann , Manuel Streicher

In 2016, Dowden initiated the study of planar Tur\'an-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every $K_3$-free $1$-planar graph on $n\ge 4$ vertices has at most $3n-6$ edges. In…

Combinatorics · Mathematics 2026-04-27 Licheng Zhang , Yuanqiu Huang , Fengming Dong

A complex compact surface which carries an automorphism of positive topological entropy has been proved by Cantat to be either a torus, a K3 surface, an Enriques surface or a rational surface. Automorphisms of rational surfaces are quite…

Algebraic Geometry · Mathematics 2015-09-02 Julie Déserti , Julien Grivaux

Whitney proved that 3-connected planar graphs admit a unique embedding on the sphere. In contrast, Enami investigated embeddings of 3-connected cubic planar graphs on non-spherical surfaces with non-negative Euler characteristic. He…

Combinatorics · Mathematics 2026-05-25 Meike Weiß , Alice C. Niemeyer

Let S be a finite union of (pairwise disjoint but possibly knotted and linked) closed curves and tubes in the round sphere S^3 or in the flat torus T^3. In the case of the torus, S is further assumed to be contained in a contractible subset…

Analysis of PDEs · Mathematics 2015-05-26 Alberto Enciso , Daniel Peralta-Salas , Francisco Torres de Lizaur

This paper is the third in a series where we describe the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. In [CM3]-[CM5] we describe the case where the surfaces are topologically disks on…

Analysis of PDEs · Mathematics 2007-05-23 Tobias H. Colding , William P. Minicozzi

A \emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \leq 4$, Pach and T\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which…

Computational Geometry · Computer Science 2016-08-31 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

Discrete Mathematics · Computer Science 2020-10-06 N. R. Aravind , Udit Maniyar

This paper classifies toric Fano 3-folds with singular locus { 1/k(1,1,1) } for any positive integer k, building on the work of Batyrev and Watanabe-Watanabe. This is achieved by completing an equivalent problem in the language of Fano…

Algebraic Geometry · Mathematics 2020-09-08 Daniel Cavey

We survey crystalline cohomology, crystals, and formal group laws with an emphasis on geometry. We apply these concepts to K3 surfaces, and especially to supersingular K3 surfaces. In particular, we discuss stratifications of the moduli…

Algebraic Geometry · Mathematics 2023-02-09 Christian Liedtke

We consider the problem of finding the minimum-weight subgraph that satisfies given connectivity requirements. Specifically, given a requirement $r \in \{0,1,2,3\}$ for every vertex, we seek the minimum-weight subgraph that contains, for…

Data Structures and Algorithms · Computer Science 2016-11-15 Glencora Borradaile , Baigong Zheng

We proved the existence of rational curves in every linear system on a general K3 surface and that all rational curves in the hyperplane class are nodal on a general K3 surface of small genus.

Algebraic Geometry · Mathematics 2007-05-23 Xi Chen

We determine for which $n$, the complete bipartite graph $K_{n,n}$ 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-12-24 Blake Mellor