Bobkov–Houdré–Tetali's optimal functions conjecture for odd cycles
Let be a cycle, let be an optimal function on , and let denote graph distance. Then is an optimal function in the subgaussian sense described in the source.
Bobkov–Houdré–Tetali conjecture. There exists a vertex such that, for every ,
Bobkov, Houdré, and Tetali proposed this characterization for optimal functions on odd cycles, and Sammer and Tetali repeated it. The supplied text does not state whether the conjecture has been resolved.
References
Primary source
Matthew Yancey, “Probabilistic and Geometrical Applications to Graph Theory”, arXiv:1705.09725 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.