ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn, let L(G)\mathcal{L}(G) denote the set of longest paths of GG, and let f(G,P)f(G,\mathcal{P}) denote the distance parameter for a subset P\mathcal{P} of longest paths. A function gg is sublinear if g(n)/n→0g(n)/n\to 0 as n→∞n\to\infty. Sublinear-distance conjecture. There exists a sublinear function gg such that for every connected graph GG of order nn and every subset P\mathcal{P} of L(G)\mathcal{L}(G) with 3≤∣P∣≤63\leq |\mathcal{P}|\leq 6, f(G,P)≤g(n)f(G,\mathcal{P})\leq g(n). 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.