Related papers: On curves intersecting at most once

We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…

The \emph{canonical degree} of a curve $C$ on a surface $X$ is $K_X\cdot C$. Our main result, is that on a surface of general type there are only finitely many curves with negative self--intersection and sufficiently large canonical degree.…

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…

Given a fixed positive integer $k$, the $k$-planar local crossing number of a graph $G$, denoted by $\text{LCR}_k(G)$, is the minimum positive integer $L$ such that $G$ can be decomposed into $k$ subgraphs, each of which can be drawn in a…

Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2\Delta(\lceil…

Let X be a smooth genus g curve equipped with a simple morphism f: X -> C, where C is either the projective line or more generally any smooth curve whose gonality is computed by finitely many pencils. Here we apply a method developed by…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

We consider the homotopical dynamics on compact orientable surfaces of positive genus g. We establish a sufficient and necessary algebraic criterion for homotopy classes with infinitely many periodic points of maps on such surfaces in terms…

We study the gonality of curves $C$ over $\mathbb C$ whose normalization is composed of one or two copies of $\mathbb P^1$. In the first case, $C$ is a nodal curve with $g(C)$ nodes, and in the second case $C$ is a so-called binary curve.…

Let $ S_g $ be a closed surface of genus $ g $ and let $ (\alpha, \beta) $ be a filling pair on $ S_g $; then $ i(\alpha, \beta) \geq 2g-1 $, where $ i $ is the (geometric) intersection number. Aougab and Huang demonstrated that…

For a compact surface $ S $ with a finite set of marked points $ P $, we define a 1-system to be a collection of arcs which are pairwise non-homotopic and intersect pairwise at most once. We prove that, up to equivalence, there are exactly…

We prove that for any number field $K$ and any fixed genus $g \geq 2$, there are infinitely many non-isomorphic hyperelliptic curves of genus $g$ over $K$ whose Jacobians have rank over $K$ equal to each of 0, 1, or 2. As an example of our…

We prove the following result which was conjectured by Stichtenoth and Xing: let $g$ be the genus of a projective, irreducible non-singular curve over the finite field $\Bbb F_{q^2}$ and whose number of $\Bbb F_{q^2}$-rational points…

The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…

A non-separating multicurve of a surface S of genus g with m punctures is a multicurve c so that S-c is connected. For k>0 define the graph of non-separting k-multicurves to be the graph whose vertices are non-separating multicurves with k…

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…

It is shown that the log-canonical threshold of a curve with an isolated singularity is computed by the term ideal of the curve in a suitable system of local parameters at the singularity. The proof uses the Enriques diagram of the…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…