# Arrangements of orthogonal circles with many intersections

## DOI:

https://doi.org/10.7155/jgaa.00614## Abstract

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an*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 $\pi/2$. For the case where circles can be nested we prove that the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies in between $4n - O\left(\sqrt{n}\right)$ and $\left(4+\frac{5}{11}\right)n$, for $n$ being the number of circles. Based on the lower bound we can also improve the lower bound for the number of triangles in arrangements of orthogonal circles to $(3 + \frac{5}{9})n-O\left(\sqrt{n}\right)$.

### Downloads

Download data is not yet available.

## Downloads

## Published

2023-02-01

## How to Cite

*Journal of Graph Algorithms and Applications*,

*27*(2), 49–70. https://doi.org/10.7155/jgaa.00614

## Issue

## Section

Articles

## Categories

## License

Copyright (c) 2023 Sarah Carmesin, André Schulz

This work is licensed under a Creative Commons Attribution 4.0 International License.