English
Related papers

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

200 papers

We propose a class of toric Lagrangian A-branes on the resolved conifold that is suitable to describe torus knots on S^3. The key role is played by the SL(2,Z) transformation, which generates a general torus knot from the unknot. Applying…

High Energy Physics - Theory · Physics 2014-07-14 Hans Jockers , Albrecht Klemm , Masoud Soroush

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

Group Theory · Mathematics 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano

We show that the recognition problem for penny graphs (contact graphs of unit disks in the plane) is $\exists\mathbb{R}$-complete, that is, computationally as hard as the existential theory of the reals, even if a combinatorial plane…

Computational Geometry · Computer Science 2025-08-15 Anna Lubiw , Marcus Schaefer

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…

Combinatorics · Mathematics 2008-09-09 Vida Dujmovic' , David Eppstein , Matthew Suderman , David R. Wood

We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…

Combinatorics · Mathematics 2022-04-12 Jordi Castellví , Marc Noy , Clément Requilé

Cai et al.\ proved that a toroidal graph $G$ without $6$-cycles is $5$-choosable, and proposed the conjecture that $\textsf{ch}(G) = 5$ if and only if $G$ contains a $K_{5}$ [J. Graph Theory 65 (2010) 1--15], where $\textsf{ch}(G)$ is the…

Combinatorics · Mathematics 2025-02-25 Ping Chen , Tao Wang

A graph $G$ is \emph{uniquely k-colorable} if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. For a plane graph $G$, two faces $f_1$ and $f_2$ of $G$ are \emph{adjacent $(i,j)$-faces} if…

Combinatorics · Mathematics 2015-09-11 Zepeng Li , Naoki Matsumoto , Enqiang Zhu , Jin Xu , Tommy Jensen

We study isogeny relations between K3 surfaces and Kummer surfaces. Specifically, we prove a Torelli-type theorem for the existence of rational maps from K3 surfaces to Kummer surfaces, and a Kummer sandwich theorem for K3 surfaces with…

Algebraic Geometry · Mathematics 2011-09-05 Shouhei Ma

Here we consider the hypergraph Tur\'an problem in uniformly dense hypergraphs as was suggested by Erd\H{o}s and S\'os. Given a $3$-graph $F$, the uniform Tur\'an density $\pi_u(F)$ of $F$ is defined as the supremum over all $d\in[0,1]$ for…

Combinatorics · Mathematics 2025-10-15 August Y. Chen , Bjarne Schülke

We investigate both geometric and conformal field theoretic aspects of mirror symmetry on N=(4,4) superconformal field theories with central charge c=6. Our approach enables us to determine the action of mirror symmetry on (non-stable)…

High Energy Physics - Theory · Physics 2009-11-07 Werner Nahm , Katrin Wendland

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

Combinatorics · Mathematics 2020-10-15 Andrey Kupavskii , Alexandr Polyanskii , István Tomon , Dmitriy Zakharov

We present some families of cubic hypersurfaces in $\mathbb P^5 (\mathbb C)$ containing a plane whose associated quadric bundle does not have a rational section.

Algebraic Geometry · Mathematics 2016-06-30 Federica Galluzzi

A paper torus is a piecewise linear isometric embedding of a flat torus into $\R^3$. Following up on the $8$-vertex paper tori discovered by the second author, we prove universality and collapsibility results about these objects. One…

Metric Geometry · Mathematics 2025-11-03 Peter Doyle , Richard Evan Schwartz

We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…

Data Structures and Algorithms · Computer Science 2018-09-25 Emilio Di Giacomo , William J. Lenhart , Giuseppe Liotta , Timothy W. Randolph , Alessandra Tappini

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level…

Data Structures and Algorithms · Computer Science 2016-08-30 Patrizio Angelini , Giordano Da Lozzo , Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani , Ignaz Rutter

In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those that are obtained from a regular triangulation of the $r \times s$ toroidal grid where the vertices in the first and last column are…

Combinatorics · Mathematics 2022-10-11 Brahadeesh Sankarnarayanan

This paper is a survey about $K3$ surfaces with an automorphism and log rational surfaces, in particular, log del Pezzo surfaces and log Enriques surfaces. It is also a reproduction on my talk at "Mathematical structures of integrable…

Algebraic Geometry · Mathematics 2019-01-03 Shingo Taki

Let E be an elliptic curve defined over Q. We study the relationship between the torsion subgroup E(Q)_tors and the torsion subgroup E(K)_tors, where K is a cubic number field. In particular, We study the number of cubic number fields K…

Number Theory · Mathematics 2017-01-05 Enrique Gonzalez-Jimenez , Filip Najman , Jose M. Tornero

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

Combinatorics · Mathematics 2014-10-22 K. Dosen , Z. Petric

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…

Computational Geometry · Computer Science 2016-07-19 Franz J. Brandenburg , Walter Didimo , William S. Evans , Philipp Kindermann , Giuseppe Liotta , Fabrizio Montecchiani
‹ Prev 1 8 9 10 Next ›