Krishnan's Conjecture 5 on generalized Petersen zero forcing numbers
For every integer , the zero-forcing number of the generalized Petersen graph is . Here has vertex set and edges , , and for all .
References
- Sharp zero forcing numbers for the generalized Petersen graphs P(n,3) and P(n,4) — arXiv — Arnav Krishnan, Haobo Ma, Wenlin Zhang
Source: arXiv
Progress summary
Refreshed
Open · solution reported
An October preprint claims a complete solution for two infinite families, but the claim has not been independently checked.
Krishnan's Conjecture 5 concerns the exact zero-forcing number of generalized Petersen graphs, especially ; the latest claim also treats .
Known results
- The earlier assertion for all is false: .
- The correction proves for all .
- Exhaustive computation gives for , but does not establish the conjecture for all larger .
- The correction identifies rigorous lower bounds for as open.
October 2026 claimed resolution
The unrefereed preprint presents this as a resolution, but the claim is unverified.
Current status (as of October 2026): The conjecture is claimed solved for and , but the new proof has not been independently verified.
Solutions 0
No solutions have been posted yet.