arXiv (All)
open access
Three-Neighbour Bootstrap Percolation in Thin Three-Dimensional Grids
We improve the status of the problem of determining minimum-sized percolating sets in $a \times b \times c$ grids under the $3$-neighbour process. Using several new constructions, we show that optimal percolating sets exist whenever $\min(a,b,c) \ge 7$. As an important step toward this, we also show
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Embedding Trees and Cactus Graphs with Integer Edge Lengths on a Compact Integer Grid#1115478
- A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces#1203810
- Improved Metric Distortion Bounds for Deterministic Weighted-Tournament Voting Rules#615225
- Improved Metric Distortion Bounds for Deterministic Weighted-Tournament Voting Rules#614258
- The untangling number as a measurement of entanglement complexity in 3-periodic networks#1232600
Record · ID 1296365
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive