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

The Bar\'at-Thomassen conjecture asserts that for every tree $T$ on $m$ edges, there exists a constant $k_T$ such that every $k_T$-edge-connected graph with size divisible by $m$ can be edge-decomposed into copies of $T$. So far this…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…

A simple closed curve $\gamma$ in the real projective plane $P^2$ is called anti-convex if for each point $p$ on the curve, there exists a line which is transversal to the curve and meets the curve only at $p$. We shall prove the relation…

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…

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…

We prove that if a family of compact connected sets in the plane has the property that every three members of it are intersected by a line, then there are three lines intersecting all the sets in the family. This answers a question of…

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have.…

We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

For a given real generic curve $\ga: S^1\to \Bbb {RP}^n$ let $D_\ga$ denote the ruled hypersurface in $\Bbb {RP}^n$ consisting of all osculating subspaces to $\ga$ of codimension 2. A curve $\ga: S^1\to \Bbb {RP}^n$ is called convex if the…

Let $S_g$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of collections of $2g+1$ simple closed curves on $S_g$ which pairwise intersect exactly once, extending a result of the…

The Bar\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into…

Consider two paths $\phi,\psi:[0;1]\to [0;1]^2$ in the unit square such that $\phi(0)=(0,0)$, $\phi(1)=(1,1)$, $\psi(0)=(0,1)$ and $\psi(1)=(1,0)$. By continuity of $\phi$ and $\psi$ there is a point of intersection. We prove that from…

We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lov\'{a}sz from 1969 and Thomassen from 1978, respectively, states that all connected vertex-transitive graphs…

We prove that for every smooth Jordan curve $\gamma$, if $X$ is the set of all $r \in [0,1]$ so that there is an inscribed rectangle in $\gamma$ of aspect ratio $\tan(r\cdot \pi/4)$, then the Lebesgue measure of $X$ is at least $1/3$. To do…

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…

A family $\mathcal{A}$ of sets is {\it $t$-intersecting} if the cardinality of the intersection of every pair of sets in $\mathcal{A}$ is at least $t$, and is an {\it $r$-family} if every set in $\mathcal{A}$ has cardinality $r$. A…