Related papers: Large Collections of Curves Pairwise Intersecting …

Given a set equipped with a transitive action of a group, we define the notion of an almost invariant coloring of the set. We consider the mapping class group orbit of a multicurve on a compact surface, and prove that in the case of genus…

The study of algebraic curves $\cX$ with numerous automorphisms in relation to their genus $g(\cX)$ is a well-established area in Algebraic Geometry. In 1995, Irokawa and Sasaki \cite{Sasaki} gave a complete classification of curves over…

It is known that for a smooth hyperelliptic curve to have a large $a$-number, the genus must be small relative to the characteristic of the field, $p>0$, over which the curve is defined. It was proven by Elkin that for a genus $g$…

Let $\mathcal{C}$ be a smooth, projective, genus $g\geq 2$ curve, defined over $\mathbb{C}$. Then $\mathcal{C}$ has \emph{many automorphisms} if its corresponding moduli point $p \in \mathcal{M}_g$ has a neighborhood $U$ in the complex…

Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

In a graph $G$ of maximum degree 3, let $\gamma(G)$ denote the largest fraction of edges that can be 3 edge-coloured. Rizzi \cite{Riz09} showed that $\gamma(G) \geq 1-\frac{2\strut}{\strut 3 g_{odd}(G)}$ where $g_{odd}(G)$ is the odd girth…

Consider a Jacobian elliptic surface $E \to C$ with a section $P$ of infinite order. Previous work of the first author and Urz\'ua over the complex numbers gives a bound on the number of tangencies between $P$ and a torsion section of $E$…

This paper concerns rigidity of the mapping class groups. We show that any homomorphism $\phi:{\rm Mod}_g\to {\rm Mod}_h$ between mapping class groups of closed orientable surfaces with distinct genera $g>h$ is trivial if $g\geq 3$ and has…

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…

We investigate the existence of maximal collections of mutually noncrossing $k$-element subsets of $\left\{ 1, \dots, n \right\}$ that are invariant under adding $k\pmod n$ to all indices. Our main result is that such a collection exists if…

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…

Let $\omega(G)$ and $\chi(G)$ denote the clique number and chromatic number of a graph $G$, respectively. The {\em disjointness graph} of a family of curves (continuous arcs in the plane) is the graph whose vertices correspond to the curves…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a {\em touching point}. The main result of this paper is a Crossing Lemma for simple curves: Let $X$…

In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…

Let $\Gamma(n,k)$ be the set of $2$-connected $n$-vertex graphs containing an edge that is not on any cycle of length at least $k+1.$ Let $g_s(n,k)$ denote the maximum number of $s$-cliques in a graph in $\Gamma(n,k).$ Recently, Ji and Ye…

A subset X of a group G is a set of pairwise non-commuting ele- ments if ab 6= ba for any two distinct elements a and b in X. If jXj ? jY j for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset…

We show that the largest size of a collection of simple closed curves pairwise intersecting at most once on an orientable surface of Euler characteristic $\chi$ grows quadratically in $|\chi|$. This resolves a longstanding question of…

An identifying open code of a graph $G$ is a set $S$ of vertices that is both a separating open code (that is, $N_G(u) \cap S \ne N_G(v) \cap S$ for all distinct vertices $u$ and $v$ in $G$) and a total dominating set (that is, $N(v) \cap S…