Answers are grounded in this paper and cite their sources.
The concept of Gromov hyperbolicity is a geometric concept that leads to a rich general theory. Johnson and Kneser graphs are interesting combinatorial graphs defined from systems of sets. In this work we compute the precise value of the hyperbolicity constant of every Johnson graph. Also, we obtain good bounds on the hyperbolicity constant of every Kneser graph, and in many cases, we even compute its precise value.
No takes yet. Share an insight, caveat, or question.
Méndez et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: