Leaños–Acosta Troncoso–Rivera 2-token path domination conjecture
For every integer , determine whether the domination number of the -token graph of the path graph satisfies , where and is the explicitly specified constant determined by .
References
- The domination number of the -token graph of path graphs — arXiv — Emmanuel Acosta Troncoso, Luis Manuel Rivera
Source: arXiv
Progress summary
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 .
Known results
- Acosta Troncoso, Leaños, and Rivera (January 2026) proved matching-order bounds, .
- Their earlier paper established the conjectured upper bound for , computed cases through , 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 . The claim is unrefereed and has not been independently verified; cases are not covered.
Current status (as of October 2026): The formula for is claimed solved by an unrefereed computer-assisted proof, while the claim remains unverified and cases remain outside its scope.
Solutions 0
No solutions have been posted yet.