I am thinking about the following problem: Let $G$ be a graph embedded into hyperbolic space $\mathbb{H}^d$, i.e., the vertex set $V(G)$ is a subset of $\mathbb{H}^d$ and the edges are geodesic line segments connecting vertices.
Let us call such a graph an $(r, \alpha)$-graph when
- any two neighboring vertices have hyperbolic distance at least $r$ and
- whenever two edges meet in a common vertex, the angle between them is at least $\alpha$.
What I am looking for is the following statement: "For any $\alpha>0$ there exists an $r>0$ such that any $(r,\alpha)$-graph is acyclic".
This feels natural to me and I am relatively optimistic that it is true, however, I did not find it in the literature. The closest thing I found is Proposition 8 in this paper by Hansen and Müller. I believe that the proof given there could be modified to show the above statement, however I first wanted to check if it is already stated elsewhere.
So, does anyone know of a reference to this fact in the literature? (Or perhaps, do you know the statement to be false and have a counterexample?)
Any comments are greatly appreciated!