arXiv (All)
open access
FIID Coloring Random Maps
We show that the percolation components on a square grid can be $5$-colored as a factor of iid so that neighboring components get different colors. Above the critical probability, we observe that these regions can be 4-colored. Along the way, we extend the classical correspondence between fiid proce
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
- Entropy and singularity of spectral and pivotal sets in planar percolation#1109407
- The Four Color Theorem meets Shapes of Polyhedra#1118521
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs#167718
- The Borel Distinguishing Number of Schreier Graphs#1084902
- A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles#820016
Record · ID 1118963
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