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

The current state of knowledge of genus g orientable crossing numbers of complete graphs through K11 is reviewed. It is shown that cr3(K10)=3, cr3(K11)<=14, and cr4(K11)=4. It is established with the aid of an algorithm that there are…

We prove two results relating 3-manifold groups to fundamental groups occurring in complex geometry. Let N be a compact, connected, orientable 3-manifold. If N has non-empty, toroidal boundary, and \pi_1(N) is a Kaehler group, then N is the…

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n^2) \times O(n^2)$, as shown by…

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Gluck (1975) has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that linklessly embeddable graphs are generically 4-stress free. Both of these results are…

For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the…

For an integer $k\ge 3$, a $k$-path vertex cover of a graph $G=(V,E)$ is a set $T\subseteq V$ that shares a vertex with every path subgraph of order $k$ in $G$. The minimum cardinality of a $k$-path vertex cover is denoted by $\psi_k(G)$.…

We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The $3$-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains…

A K3-surface is a (smooth) surface which is simply connected and has trivial canonical bundle. In these notes we investigate three particular pencils of K3-surfaces with maximal Picard number. More precisely the general member in each…

Let X be a K3 surface of degree 8 in P^5 with hyperplane section H. We associate to it another K3 surface M which is a double cover of P^2 ramified on a sextic curve C. In the generic case when X is smooth and a complete intersection of…

We study the geometry of the K3 surfaces $X$ with a finite number automorphisms and Picard number $\geq 3$. We describe these surfaces classified by Nikulin and Vinberg as double covers of simpler surfaces or embedded in a projective space.…

In this paper, we propose certain assumptions on the principal curvatures for a closed minimal hypersurface $M^5$ in $\mathbf{S}^6$ to be isoparametric, provided that the functions $S, f_3,f_4$ are constants. Our result removes the…

The planar Tu\'{a}n number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for…

We show that every supersingular K3 surface is birational to a double cover of a projective plane.

A 2-uniform tiling is an edge-to-edge tiling by regular polygons having $2$ distinct transitivity classes of vertices. There are 20 distinct 2-uniform tilings (these are of $14$ different types) on the plane, and since the plane is the…

To pave the way for the journey from geometry to conformal field theory (CFT), these notes present the background for some basic CFT constructions from Calabi-Yau geometry. Topics include the complex and Kaehler geometry of Calabi-Yau…

This paper proves that the Alon-Tarsi number of any planar graph is at most $5$, which gives an alternate proof of the $5$-choosability as well as the $5$-paintability of planar graphs.

The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered…