Jonckheere–Lou–Bonahon–Baryshnikov conjecture on demand and inertia
Jonckheere–Lou–Bonahon–Baryshnikov conjecture on demand and inertia
Let be a large but finite graph with negative curvature. Let the demand and inertia of a vertex be the graph quantities defined in the paper. Jonckheere–Lou–Bonahon–Baryshnikov's demand–inertia conjecture. The vertices with the highest demand are near the vertices with the smallest inertia. The paper presents examples where the two types of vertices can be far apart, so the proposed relationship is challenged by the subsequent discussion.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Matthew Yancey, “Negatively Curved Graphs”, arXiv:1512.01281 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.