StatisticalMechanics / CONCEPT
The 2-neighbour bootstrap percolation number of C_n x P_m is n
In 2-neighbour bootstrap percolation on the direct product of the cycle C_n and the path P_m, the least size of a percolating set is n for every n at least 3 and m at least 1. This settles Problem 5 of Brešar, Hedžet and Herrman.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS1
Proof
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A Tree Exceeds the Path in the Cordiality Gamestructural-affinity · Closed
- Cartesian variancestructural-affinity · Closed
- Commutator gap and scalar translationstructural-affinity · Closed
- Gupta's rectangular-grid dispersion inequalitystructural-affinity · Closed
- Integer {2}-domination of three-row gridsstructural-affinity · Closed
- Polygonal couplings and the discrete Fourier transformstructural-affinity · Closed
- The k-positive region of the diagonal-perturbed Tomiyama mapsstructural-affinity · Closed
- The Least Base Maximizing the Digit Sum Is the First Base Above Halfstructural-affinity · Closed
- Weak products do not preserve edge-complexity equalitystructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance