On the Number of Edges of Fan-Crossing Free Graphs

Otfried Cheong, Sariel Har-Peled, Heuna Kim +1

A graph drawn in the plane with n vertices is k-fan-crossing free for k > 1 if there are no k+1 edges $g,e_1,...e_k$, such that $e_1,e_2,...e_k$ have a common endpoint and $g$ cros…