ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PmP_m and PnP_n be paths on mm and nn vertices, respectively, and let pr(G)\mathfrak{pr}(G) denote the minimum coprime number of a graph GG. Asplund–Fox's path-join conjecture. For any positive integer NN, there exists a positive integer MM such that for all m>Mm>M and 2≤n≤N2\leq n\leq N,

\mathfrak{pr}(P_m+P_n)=\begin{cases}m+2n-2&\text{if }m\text{ is odd},\\m+2n-1&\text{if }m\text{ is even}.

The conjecture extends the displayed formula from the cases previously established in the source to every fixed finite range 2≤n≤N2\leq n\leq N when mm is sufficiently large; no resolution is supplied in the provided text.

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.