Arrangements of orthogonal circles with many intersections
Sarah Carmesin
André Schulz
erschienen in:
Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)

An arrangement of circles in which circles intersect only in angles of π/2 is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is planar. The same result holds for arrangement of circles that intersect in an angle of at most π/2 .
For the general case we prove that the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies in between 4n O(SQR{n}) and (4 + 5/11)n , for n being the number of circles. Based on the lower bound we can also improve the bound for the number of triangles in arrangements of orthogonal circles to (3 + 5/9)n−O(SQR{n}) .

@article{DBLP:journals/corr/abs-2106-03557, author = {Sarah Carmesin and Andr{\'{e}} Schulz}, title = {Arrangements of orthogonal circles with many intersections}, journal = {CoRR}, volume = {abs/2106.03557}, year = {2021}, url = {}, eprinttype = {arXiv}, eprint = {2106.03557}, timestamp = {Thu, 10 Jun 2021 16:34:18 +0200}, biburl = {}, bibsource = {dblp computer science bibliography,} }
Christoph Doppelbauer | 10.05.2024