相关论文: On building 4-critical plane and projective plane …

A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…

A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…

A graph $G$ is said to be crossing-critical if $cr(G-e)< cr(G)$ for every edge $e$ of $G$, where $cr(G)$ is the crossing number of $G$. Richter and Thomassen [Journal of Combinatorial Theory, Series B 58 (1993), 217-224] constructed an…

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the…

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

The Ptolemy groupoid is a combinatorial groupoid generated by elementary moves on marked trivalent fatgraphs with three types of relations. Through the fatgraph decomposition of Teichm\"uller space, the Ptolemy groupoid is a mapping class…

In this paper, we study the embedded topology of smooth plane quartics and its bitangent lines via two-graphs and apply it to construct interesting examples for Zariski $m$-ple.

In this paper we consider type-preserving representations of the fundamental group of the three--holed projective plane into $\mathrm{PGL}(2, \R) =\mathrm{Isom}(\HH^2)$ and study the connected components with non-maximal euler class. We…

A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this…

The main result of this article is the decomposition of tensor products of representations of SL(2) in the sum of irreducible representations parametrized by outerplanar graphs. An outerplanar graph is a graph with the vertices 0, 1, 2,…

Many authors have constructed different, but related, linear group cocycles that are usually referred to as ``Eisenstein cocycles.'' The main goal of this work is to describe a topological construction that is a common source for all these…

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\]…

In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…

We classify the cohomology classes of Lagrangian 4-planes $\P^4$ in a smooth manifold $X$ deformation equivalent to a Hilbert scheme of 4 points on a $K3$ surface, up to the monodromy action. Classically, the cone of effective curves on a…

We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that…

It is proven that every set $S$ of distinct points in the plane with cardinality $\lceil \frac{\sqrt{\log_2 n}-1}{4} \rceil$ can be a subset of the vertices of a crossing-free straight-line drawing of any planar graph with $n$ vertices. It…

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor…

We construct a cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2. If the cardinality of the field is larger than 2, we obtain an elementary construction of the non-split extension of…

In this paper, we give an explicit construction of higher Chow cycles of type $(2,1)$ on $K3$ surfaces obtained as quadruple coverings of the projective plane ramified along smooth quartics. The construction uses a pair of bitangents of the…