English
Related papers

Related papers: On curves intersecting at most once

200 papers

We prove that on a closed, orientable surface of genus $g$, a set of simple loops with the property that no two are homotopic or intersect in more than $k$ points has cardinality $\lesssim_k g^{k+1} \log g$. The bound matches the size of…

Geometric Topology · Mathematics 2018-11-06 Joshua Evan Greene

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

Geometric Topology · Mathematics 2012-10-11 Tarik Aougab

We show that the asymptotic growth rate for the minimal cardinality of a set of simple closed curves on a closed surface of genus $g$ which fill and pairwise intersect at most $K\ge 1$ times is $2\sqrt{g}/\sqrt{K}$ as $g \to \infty$ . We…

Geometric Topology · Mathematics 2010-10-11 James W. Anderson , Hugo Parlier , Alexandra Pettet

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

Geometric Topology · Mathematics 2013-01-04 Justin Malestein , Igor Rivin , Louis Theran

We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic…

Geometric Topology · Mathematics 2014-08-27 Piotr Przytycki

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

Combinatorics · Mathematics 2025-06-12 Alfredo Hubard , Arnaud de Mesmay , Hugo Parlier

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…

Geometric Topology · Mathematics 2024-03-11 Jasmin Jörg

We prove that, as $m$ grows, any family of $m$ homotopically distinct closed curves on a surface induces a number of crossings that grows at least like $(m \log m)^2$. We use this to answer two questions of Pach, Tardos and Toth related to…

Geometric Topology · Mathematics 2025-04-02 Alfredo Hubard , Hugo Parlier

Let $\Sigma$ be a hyperbolic surface. We study the set of curves on $\Sigma$ of a given type, i.e. in the mapping class group orbit of some fixed but otherwise arbitrary $\gamma_0$. For example, in the particular case that $\Sigma$ is a…

Geometric Topology · Mathematics 2015-08-11 Viveka Erlandsson , Juan Souto

A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…

Combinatorics · Mathematics 2026-01-12 Jacob Fox , Janos Pach , Andrew Suk

We prove that for every integer $t\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\chi$-bounded. This is essentially the strongest…

Combinatorics · Mathematics 2017-10-05 Alexandre Rok , Bartosz Walczak

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

Geometric Topology · Mathematics 2020-02-17 Charles Daly , Jonah Gaster , Max Lahn , Aisha Mechery , Simran Nayak

A curve \gamma in the plane is t-monotone if its interior has at most t-1 vertical tangent points. A family of t-monotone curves F is \emph{simple} if any two members intersect at most once. It is shown that if F is a simple family of n…

Combinatorics · Mathematics 2013-07-10 Andrew Suk

The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…

Computational Geometry · Computer Science 2019-11-28 Vincent Despré , Francis Lazarus

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…

Combinatorics · Mathematics 2018-11-26 Janos Pach , Istvan Tomon

We show that the order of the cardinality of maximal complete $1$-systems of loops on non-orientable surfaces is $\sim |\chi|^{2}$. In particular, we determine the exact cardinality of maximal complete $1$-systems of loops on punctured…

Geometric Topology · Mathematics 2025-04-10 Xiao Chen

We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.

Combinatorics · Mathematics 2025-06-24 Alfredo Hubard , Hugo Parlier

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$.…

Algebraic Geometry · Mathematics 2025-06-18 Xander Faber , Jon Grantham , Everett W. Howe

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

Geometric Topology · Mathematics 2016-05-24 Patricia Cahn , Federica Fanoni , Bram Petri

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…

Combinatorics · Mathematics 2020-09-22 János Pach , Gábor Tardos , Géza Tóth
‹ Prev 1 2 3 10 Next ›