Baker and Rumely's tau lower bound conjecture for metrized graphs
Baker and Rumely's tau lower bound conjecture for metrized graphs
Let be a metrized graph, let be its total length, and consider metrized graphs with . Baker and Rumely's tau lower bound conjecture.
where the infimum is taken over all metrized graphs with nonzero total length. The conjecture asserts the existence of a universal positive lower bound for the tau constant normalized by total length. The paper states a refinement asserting the explicit bound for every metrized graph; the abstract describes as the conjectural lower bound, while the general conjecture is not presented as resolved.
Sources & referencesView supporting material
Primary source
Zubeyir Cinkir, “Families of Metrized Graphs With Small Tau Constants”, arXiv:1405.7005 (2014).
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.