3 citations · 6 across the 10 of their papers we have counts for
Showing 2023 · math.COShow all
2 papers · 2 filters
math.CO2023
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…
math.CO2023
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…