相关论文: Polyhedral surfaces of high genus

We construct a family of elliptic surfaces with $p_g=q=1$ that arise from base change of the Hesse pencil. We identify explicitly a component of the higher Noether-Lefschetz locus with positive Mordell-Weil rank, and a particular surface…

The first published non-trivial examples of algebraic surfaces of general type with maximal Picard number are due to Persson, who constructed surfaces with maximal Picard number on the Noether line $K^2=2\chi-6$ for every admissible pair…

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

A cyclic coloring of a plane graph $G$ is a coloring of its vertices such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a plane graph $G$ is its cyclic chromatic number…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors. The {\em total chromatic number} of a graph $G$, denoted by…

Let $\Delta(G)$ and $\chi'(G)$ be the maximum degree and chromatic index of a graph $G$, respectively. Appearing in different forms, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) made the following conjecture: Every…

A strong edge-coloring of a graph $G$ is a coloring of edges of $G$ such that every color class forms an induced matching. The strong chromatic index is the minimum number of colors needed to color the graph. The Ore-degree $\theta(G)$ of a…

A cyclic $n$-gonal surface is a compact Riemann surface $X$ of genus $g\geq 2$ admitting a cyclic group of conformal automorphisms $C$ of order $n$ such that the quotient space $X/C$ has genus 0. In this paper, we provide an overview of…

In 1985, Erd\H{o}s and Ne\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\Delta^2$ when $\Delta$ is even and ${1/4}(5\Delta^2-2\Delta+1)$ when $\Delta$ is odd. They gave a simple construction…

We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\tfrac12\,(1+\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…

We show that the number of square-tiled surfaces of genus $g$, with $n$ marked points, with one or both of its horizontal and vertical foliations belonging to fixed mapping class group orbits, and having at most $L$ squares, is asymptotic…

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

We consider maps on a surface of genus $g$ with all vertices of degree at least three and positive real lengths assigned to the edges. In particular, we study the family of such metric maps with fixed genus $g$ and fixed number $n$ of faces…

Let V be a plane smooth cubic curve over a finitely generated field k. The Mordell-Weil theorem for V states that there is a finite subset P \subset V(k) such that the whole V(k) can be obtained from P by drawing secants and tangents…

This article is about the graph genus of certain well studied graphs in surface theory: the curve, pants and flip graphs. We study both the genus of these graphs and the genus of their quotients by the mapping class group. The full graphs,…