Let (K 1 , 2 ) be two families of closed curves on a surface S, such that |= m,|K 2 |=n,m #m#n, each curve in 1 intersects each curve in 2 , and no point of is covered three times. When is the plane, the projective plane, or the Klein bottle, we prove that the total number of intersections in 2 is at least 10mn/9, 12mn/11, and 10 -13 m , respectively. Moreover, when m is close to n, the constants are improved. For instance, the constant for the plane, 10/9, is improved to 8/5, for n 1)/4. Consequently, we prove lower bounds on the crossing number of the Cartesian product of two cycles, in the plane, projective plane, and the Klein bottle. All lower bounds are within small multiplicative factors from easily d...
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...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractAn (m,n)-mesh is a pair (B,R) of families of closed curves in the plane, of sizes m and n, r...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
59 pages, 33 figures, revised version accepted to Journal of the ACM. The time complexity for testin...
59 pages, 33 figures, revised version accepted to Journal of the ACM. The time complexity for testin...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
Let P be a set of n points in the plane and let C be a family of simple closed curves in the plane e...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
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...
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely ma...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
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...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
AbstractAn (m,n)-mesh is a pair (B,R) of families of closed curves in the plane, of sizes m and n, r...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
59 pages, 33 figures, revised version accepted to Journal of the ACM. The time complexity for testin...
59 pages, 33 figures, revised version accepted to Journal of the ACM. The time complexity for testin...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
Let P be a set of n points in the plane and let C be a family of simple closed curves in the plane e...
Given n continuous open curves in the plane, we say that a pair is touching if they have only one in...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
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...
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely ma...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
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...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...