An adjacency-crossing graph is a graph that can be drawn such that every...
A thrackle is a graph drawn in the plane so that every pair of its
edges...
Let C be a set of curves in the plane such that no three curves in
C int...
Recently geometric hypergraphs that can be defined by intersections of
p...
We prove that the number of tangencies between the members of two famili...
We prove discrete Helly-type theorems for pseudohalfplanes, which extend...
Consider the hypergraph whose vertex set is a family of n lines in gener...
What is the maximum number of intersections of the boundaries of a simpl...
We study covering numbers and local covering numbers with respect to
dif...
Suppose that the vertices of a graph G are colored with two colors in an...
We study general Delaunay-graphs, which are a natural generalizations of...
We consider geometric graphs whose vertex set is a finite set of points
...
We prove that the intersection hypergraph of a family of n pseudo-disks
...