1 problem

Forbidden-subgraph conjecture. A $6$-chordal graph is $\frac{1}{2}$-hyperbolic if and only if it does not contain any of the ten special graphs $G_1,G_2,G_3,C_4,C_6,H_i$,…