Reformulating the Map Color Theorem
| dc.creator | Kauffman, Louis H. | |
| dc.date | 2001-12-23 | |
| dc.date | 2003-07-02 | |
| dc.date.accessioned | 2026-07-07T04:45:29Z | |
| dc.date.available | 2026-07-07T04:45:29Z | |
| dc.description | This paper discusses reformulations of the problem of coloring plane maps with four colors. The context is the edge-coloring with three colors of cubic graphs such that three distinct colors occur at each vertex. We include discussion of the Eliahou-Kryuchkov conjecture, the Penrose formula, the vector cross product formulation and the reformulations in terms of formations and factorizations due to G. Spencer-Brown. The latter includes a proof of the Spencer-Brown parity lemma and discussion of the parity-pass algorithm. | |
| dc.description | 40 pages, 28 figures, LaTeX graphics | |
| dc.identifier | https://arxiv.org/abs/math/0112266 | |
| dc.identifier | http://arxiv.org/abs/math/0112266 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62972 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | Reformulating the Map Color Theorem | |
| dc.type | text |