The four-colour theorem, or four colour map theorem, states that given any separation of a plane into contiguous regions, called a map, the regions can be coloured using at most four colours so that no two adjacent regions have the same colour. Regions are considered adjacent if they share a boundary segment.
See also
On the logical equivalence between the four-colour theorem and a statement about the transition from the small N limit to the large N limit for Lie algebra weight systems on Jacobi diagrams via the 't Hooft double line construction:
On a reformulation of the four-colour theorem as a statement about typing in lambda calculus:
Noam Zeilberger, Linear lambda terms as invariants of rooted trivalent maps (arXiv:1512.06751).
Noam Zeilberger, A theory of linear typings as flows on 3-valent graphs (arXiv:1804.10540).
Last revised on September 11, 2021 at 03:57:21. See the history of this page for a list of all contributions to it.