English
Related papers

Related papers: On the Richter-Thomassen Conjecture about Pairwise…

200 papers

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

Combinatorics · Mathematics 2021-02-19 Peter Frankl , Andreas Holmsen , Andrey Kupavskii

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

Metric Geometry · Mathematics 2013-11-25 Imre Barany , Jiri Matousek , Attila Por

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…

Geometric Topology · Mathematics 2012-08-21 Sergei Lanzat , Michael Polyak

A closed subscheme of codimension two $T \subset P^2$ is a quasi complete intersection (q.c.i.) of type $(a,b,c)$ if there exists a surjective morphism $\mathcal{O} (-a) \oplus \mathcal{O} (-b) \oplus \mathcal{O} (-c) \to \mathcal{I} _T$.…

Algebraic Geometry · Mathematics 2019-01-04 Philippe Ellia

We prove a multiplicity result for rectangular pegs that there is a generic class of smooth Jordan curves in which every curve admits two geometrically distinct similar inscribed rectangles with aspect angle in $(0,\frac{\pi}{2})$, based on…

Symplectic Geometry · Mathematics 2024-11-12 Zhen Gao

We prove that a set $\mathcal X\subset \mathbb{C}^2,\ \#{\mathcal X}=mn,\ m\le n, $ is the set of intersection points of some two plane algebraic curves of degrees $m$ and $n,$ respectively, if and only if the following conditions are…

Algebraic Geometry · Mathematics 2019-04-09 Hakop Hakopian , Davit Voskanyan

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

Combinatorics · Mathematics 2025-11-05 Arijit Bishnu , Mathew Francis , Pritam Majumder

The Erdos-Ko-Rado theorem tells us how large an intersecting family of r-sets from an n-set can be, while results due to Lovasz and Tuza give bounds on the number of singletons that can occur as pairwise intersections of sets from such a…

Combinatorics · Mathematics 2007-05-23 John Talbot

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball

We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…

Algebraic Geometry · Mathematics 2015-06-11 Frédéric Bihan , Boulos El Hilany

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…

Combinatorics · Mathematics 2017-06-20 Peter Borg

A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…

Combinatorics · Mathematics 2025-11-04 Daniel Cizma , Nati Linial

We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at most $(\frac{1}{4}-\epsilon)\frac{n^{2}}{2}$ pairs of curves…

Combinatorics · Mathematics 2019-08-16 Istvan Tomon

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

Computational Geometry · Computer Science 2026-03-06 Alexandra Weinberger , Ji Zeng

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

Computational Geometry · Computer Science 2022-03-14 Oswin Aichholzer , Alfredo García , Javier Tejel , Birgit Vogtenhuber , Alexandra Weinberger

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

Geometric Topology · Mathematics 2025-08-25 Ferit Öztürk

We show that if a graph $G$ with $n \geq 3$ vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then $G$ has at most $6n-12$ edges. This settles a conjecture of Pach, Radoi\v{c}i\'{c},…

Combinatorics · Mathematics 2019-03-26 Eyal Ackerman

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

Given two general rational curves of the same degree in two projective spaces, one can ask whether there exists a third rational curve of the same degree that projects to both of them. We show that, under suitable assumptions on the degree…

Algebraic Geometry · Mathematics 2022-05-24 Matteo Gallet , Josef Schicho

We prove that there are $O(n)$ tangencies among any set of $n$ red and blue planar curves in which every pair of curves intersects at most once and no two curves of the same color intersect. If every pair of curves may intersect more than…

Combinatorics · Mathematics 2021-03-05 Eyal Ackerman , Balázs Keszegh , Dömötör Pálvölgyi