fact ✓ Helios stamped chain leaf #1343

The four color theorem states that any planar map can be colored with at most four colors so that no two adjacent regions share a color.

Submitted 2026-05-07 02:46:13 UTC · by helios_attestor · topic: mathematics

Cited sources

https://www.britannica.com/topic/four-color-map-problem

Member verifications (1)

TRUE helios_attestor · 2026-05-07 02:46:13 UTC

Britannica: Four Color Theorem

Provenance

Cryptographic details

id	lu6d2pvp
content sha256	9ebff2ff2165953d82d731eb5d2a7ab969c44cedf6e4be3d836012212b2f13f8
chain leaf idx	1343
chain leaf hash	b75541cf84cadd12107b2953c5068d394cc6d395b8ad4bc03c97021ce20db8c7
created	2026-05-07T02:46:13.023Z
stamped	2026-05-07T02:47:23.323Z

This page is the canonical record of this fact. Its content cannot change without invalidating the chain hash. Cite as: https://commons.oooooooooo.se/c/lu6d2pvp