Strict 1/108 lower bound conjecture for the tau constant
Strict 1/108 lower bound conjecture for the tau constant
Let be a metrized graph, let denote its tau constant, and let denote its total length.
Strict lower bound conjecture. For every metrized graph ,
The conjecture refines the Baker–Rumely lower bound by proposing the explicit sharp constant . The source reports computational and theoretical evidence that tau constants can approach, but not attain, this value; no resolution is supplied in the paper.
Sources & referencesView supporting material
Primary source
Zubeyir Cinkir, “The tau constant and the edge connectivity of a metrized graph”, arXiv:0901.1481 (2009).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.