Combinatorics / CONCEPT
The unrestricted grid-power zero-forcing conjecture is false
Conjecture 12 as printed fails: two initially black vertices force the three-by-two grid at power one, whereas the conjectured value is three.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH9
DOCUMENT LINKS0
The three-by-two counterexample
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Every Ten-Vertex Set Has Boundary at Least Eightstructural-affinity · Closed
- Forts and Mask Completenessstructural-affinity · Closed
- Fourteen-Column Words with a Long Gapstructural-affinity · Closed
- From Exceptional Gap Words to Layer Supportsstructural-affinity · Closed
- Ordinary zero forcing, symmetric maximum nullity, and minimum rank of unequal-leg spider powersstructural-affinity · Closed
- Radius-Four Column Compressionstructural-affinity · Closed
- The Zero Forcing Number of P(n,3)structural-affinity · Closed
- Zero forcing powers of equal-legged spidersstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance