3 citations · 6 across the 10 of their papers we have counts for
Showing 2015 · math.COShow all
3 papers · 2 filters
math.CO2015
Coloring points with respect to squares
Eyal Ackerman, Balázs Keszegh, Máté Vizer
We consider the problem of -coloring geometric hypergraphs. Specifically, we show that there is a constant such that any finite set of points in the plane $\mathcal{S} \subs…
math.CO2015
On the size of planarly connected crossing graphs
Eyal Ackerman, Balázs Keszegh, Mate Vizer
We prove that if an -vertex graph can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoi…
math.CO2015
On topological graphs with at most four crossings per edge
Eyal Ackerman
We show that if a graph with vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then has at most edges…