3 citations · 6 across the 10 of their papers we have counts for
17 papers
On the maximum number of tangencies among -intersecting curves
Eyal Ackerman, Balázs Keszegh
According to a conjecture of Pach, there are tangent pairs among any family of Jordan arcs in which every pair of arcs has precisely one common point and no three arcs s…
The Zarankiewicz Problem for Polygon Visibility Graphs
Eyal Ackerman, Balázs Keszegh
We prove a quasi-linear upper bound on the size of -free polygon visibility graphs. For visibility graphs of star-shaped and monotone polygons we show a linear bound. In t…
The maximum number of digons formed by pairwise crossing pseudocircles
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2
In 1972, Branko Grünbaum conjectured that any arrangement of pairwise crossing pseudocircles in the plane can have at most digons (regions enclosed by exactly two pseu…
On the number of digons in arrangements of pairwise intersecting circles
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh +2
A long-standing open conjecture of Branko Grünbaum from 1972 states that any simple arrangement of pairwise intersecting pseudocircles in the plane can have at most digo…
The maximum size of adjacency-crossing graphs
Eyal Ackerman, Balázs Keszegh
An adjacency-crossing graph is a graph that can be drawn such that every two edges that cross the same edge share a common endpoint. We show that the number of edges in an -vert…
On the number of tangencies among -intersecting -monotone curves
Eyal Ackerman, Balázs Keszegh
Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is e…