Asplund–Fox conjecture for minimum coprime numbers of joins of paths
Statement
Let and be paths on and vertices, respectively, and let denote the minimum coprime number of a graph . Asplund–Fox's path-join conjecture. For any positive integer , there exists a positive integer such that for all and ,
\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 when 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.