Given n continuous open curves in the plane, we say that a pair is touching if they have only one interior point in common and at this point the first curve does not get from one side of the second curve to its other side. Otherwise, if the two curves intersect, they are said to form a crossing pair. Let t and c denote the number of touching pairs and crossing pairs, respectively. We prove that c ≥ 1/105 t2/n2, provided that t ≥ 10n Apart from the values of the constants, this result is best possible. © Springer International Publishing AG 2018
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
A long standing conjecture of Richter and Thomassen states that the total number of in-tersection po...
We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossi...
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely ma...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
A long standing conjecture of Richter and Thomassen states that the total number of intersection poi...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection poi...
\u3cp\u3eGiven a set of planar curves (Jordan arcs), each pair of which meets — either crosses or to...
Given a set of planar curves (Jordan arcs), each pair of which meets — either crosses or touches — e...
Given a set of planar curves (Jordan arcs), each pair of which meets — either crosses or touches — e...
Let (K 1 , 2 ) be two families of closed curves on a surface S, such that |= m,|K 2 |=n,m ...
Let G be a graph with n vertices and e≥4n edges, drawn in the plane in such a way that if two or mor...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
A long standing conjecture of Richter and Thomassen states that the total number of in-tersection po...
We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossi...
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely ma...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
A long standing conjecture of Richter and Thomassen states that the total number of intersection poi...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection poi...
\u3cp\u3eGiven a set of planar curves (Jordan arcs), each pair of which meets — either crosses or to...
Given a set of planar curves (Jordan arcs), each pair of which meets — either crosses or touches — e...
Given a set of planar curves (Jordan arcs), each pair of which meets — either crosses or touches — e...
Let (K 1 , 2 ) be two families of closed curves on a surface S, such that |= m,|K 2 |=n,m ...
Let G be a graph with n vertices and e≥4n edges, drawn in the plane in such a way that if two or mor...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
A long standing conjecture of Richter and Thomassen states that the total number of in-tersection po...
We show that any set of n points in general position in the plane determines n1−o(1) pairwise crossi...