Bobkov–Houdré–Tetali's optimal functions conjecture for odd cycles

Let CnC_n be a cycle, let XX be an optimal function on CnC_n, and let dd denote graph distance. Then XX is an optimal function in the subgaussian sense described in the source.

Bobkov–Houdré–Tetali conjecture. There exists a vertex x0V(Cn)x_0\in V(C_n) such that, for every vV(Cn)v\in V(C_n),

X(v)X(v0)=d(x0,v).|X(v)-X(v_0)|=d(x_0,v).

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.

Sources & referencesView supporting material

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.