3 problems

Alikhani–Soltani's conjecture. For all but a finite number of connected graphs $G$ with at least three vertices,

Let $G$ be a large but finite graph with negative curvature. Suppose its symmetric group fixes a unique point $v_0$. Let the inertia and demand of a vertex be the quantities define…

Let $G$ be a large but finite graph with positive curvature. A graph is vertex-transitive when for every pair of vertices there is a graph isomorphism taking one to the other. Let…