The optical-index ratio bound for trees
Statement
Let be a tree, and let and denote its undirected optical index and path-packing number, respectively. The optical-index ratio conjecture. For any tree ,
The lower bound is immediate from the definitions, while the upper bound is motivated by the complete -ary tree constructions in the paper, whose ratios approach . It remains open whether this universal upper bound holds for every tree.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.