2000 character limit reached
Obstructions to a small hyperbolicity in Helly graphs (1709.02837v2)
Published 8 Sep 2017 in cs.DS, cs.DM, and math.CO
Abstract: It is known that for every graph $G$ there exists the smallest Helly graph $\cal H(G)$ into which $G$ isometrically embeds ($\cal H(G)$ is called the injective hull of $G$) such that the hyperbolicity of $\cal H(G)$ is equal to the hyperbolicity of $G$. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structural obstructions to a small hyperbolicity in Helly graphs.