Sublinear-distance conjecture for three to six longest paths
Statement
Let be a connected graph of order , let denote the set of longest paths of , and let denote the distance parameter for a subset of longest paths. A function is sublinear if as . Sublinear-distance conjecture. There exists a sublinear function such that for every connected graph of order and every subset of with , . The source states that this conjecture is equivalent to the common-vertex conjecture for three through six longest paths; it is not resolved in the paper.
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.