← All problems

Leaños–Acosta Troncoso–Rivera 2-token path domination conjecture

For every integer n≥13n\ge 13, determine whether the domination number of the 22-token graph of the path graph PnP_n satisfies γ(F2(Pn))=d(n)\gamma(F_2(P_n))=d(n), where d(n)=110(n2+5n+cn)d(n)=\frac{1}{10}(n^2+5n+c_n) and cnc_n is the explicitly specified constant determined by n mod 5n\bmod 5.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed computer-assisted paper claims the exact formula for paths with at least 13 vertices, while smaller cases remain outside the claim.

The conjecture identifies the domination number of the 2-token graph of a path with a residue-class formula for every n≥13n \ge 13.

Known results

  • Acosta Troncoso, Leaños, and Rivera (January 2026) proved matching-order bounds, γ(F2(Pn))=n210+Θ(n)\gamma(F_2(P_n))=\frac{n^2}{10}+\Theta(n).
  • Their earlier paper established the conjectured upper bound for n≥20n \ge 20, computed cases through n=25n=25, and stated the exact formula as Conjecture 2.2.
  • Gómez-Soto et al. (2018) supplied the packing-number lower bound used for the asymptotic estimate.

October 2026 claimed proof

A new paper by Emmanuel Acosta Troncoso and Luis Manuel Rivera claims a computer-assisted lower bound matching the known upper bound, thereby proving the residue-class formula for all n≥13n \ge 13. The claim is unrefereed and has not been independently verified; cases n<13n<13 are not covered.

Current status (as of October 2026): The formula for n≥13n \ge 13 is claimed solved by an unrefereed computer-assisted proof, while the claim remains unverified and cases n<13n<13 remain outside its scope.

Sources

Solutions 0

No solutions have been posted yet.