← All problems

Krishnan's Conjecture 5 on generalized Petersen zero forcing numbers

For every integer n≥13n\ge 13, the zero-forcing number of the generalized Petersen graph P(n,3)P(n,3) is Z(P(n,3))=8Z(P(n,3))=8. Here P(n,3)P(n,3) has vertex set {ui,vi:i∈Z/nZ}\{u_i,v_i: i\in\mathbb{Z}/n\mathbb{Z}\} and edges uiui+1u_i u_{i+1}, uiviu_i v_i, and vivi+3v_i v_{i+3} for all i∈Z/nZi\in\mathbb{Z}/n\mathbb{Z}.

References

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 P(n,3)P(n,3); the latest claim also treats P(n,4)P(n,4).

Known results

  • The earlier assertion Z(P(n,3))=8Z(P(n,3))=8 for all n≥12n\ge 12 is false: Z(P(12,3))=7Z(P(12,3))=7.
  • The correction proves Z(P(n,3))≤8Z(P(n,3))\le 8 for all n≥9n\ge 9.
  • Exhaustive computation gives Z(P(n,3))=8Z(P(n,3))=8 for 13≤n≤2013\le n\le 20, but does not establish the conjecture for all larger nn.
  • The correction identifies rigorous lower bounds for k≥4k\ge 4 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 P(n,3)P(n,3) and P(n,4)P(n,4), but the new proof has not been independently verified.

Sources

Solutions 0

No solutions have been posted yet.