Related papers: Large Collections of Curves Pairwise Intersecting …

Let f: C --> P^3 be a general curve of genus g, mapped to P^3 via a general linear series of degree d; and let Q be a general (and thus smooth) quadric. In this paper, we show that the points of intersection f(C) \cap Q give a general…

Let $S_g$ be a closed orientable surface of genus $g\geq 2$. A collection $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $S_g$ such that $\gamma_i$ and $\gamma_j$ are in minimal position, is…

The gonality of a smooth geometrically connected curve over a field $k$ is the smallest degree of a nonconstant $k$-morphism from the curve to the projective line. In general, the gonality of a curve of genus $g \ge 2$ is at most $2g - 2$.…

Let $S$ be a hyperbolic oriented Riemann surface of finite type. The main purpose of this paper is to show that non-trivial geometric intersection between closed curves on $S$ is detected by some symplectic submodules they naturally…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

We show that any set of distinct homotopy classes of simple closed curves on the torus that pairwise intersect at most $k$ times has size $k + O(\sqrt{k} \log k)$. Prior to this work, a lemma of Agol, together with the state of the art…

Let $S_{g}$ denote the closed orientable surface of genus $g$. In joint work with Huang, the first author constructed exponentially-many (in $g$) mapping class group orbits of pairs of simple closed curves whose complement is a single…

We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…

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 graph property $\mathcal{P}$ and a common vertex set $V = \{1, 2, \ldots, n\}$, a family of graphs on $V$ is \emph{$\mathcal{P}$-intersecting} iff $G \cap H$ satisfies $\mathcal{P}$ for all $G,H$ in the family. Addressing a question…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g, n) \neq (1,2)$ and $g + n \neq 4$, then there is an exhaustion of…

In this short note, we construct a minimally intersecting pair of simple closed curves that fill a genus 2 surface with an odd, greater than 3, number of punctures. This finishes the determination of minimally intersecting filling pairs for…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…

Let $S_g$ denote the genus $g$ closed orientable surface. A \emph{coherent filling pair} of simple closed curves, $(\alpha,\beta)$ in $S_g$, is a filling pair that has its geometric intersection number equal to the absolute value of its…

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…

A system of simple closed curves on a surface of genus $g$ is said to be sparse if their average pairwise intersection number does not exceed one. We show that the maximal size of a sparse curve systems grows roughly like a function of type…

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

For each m>=1 and k>=2, we construct a graph G=(V,E) with \omega(G)=m such that max_{1\leq i\leq k} \omega(G[V_i])=m for arbitrary partition V=V_1\cup...\cup V_k, where \omega(G) is the clique number of G and G[V_i] is the induced subgraph…

Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is either a crossing or a touching point. J\'anos Pach…

Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…