Reformulating the map color theorem

From MaRDI portal
Publication:2575792

DOI10.1016/J.DISC.2004.07.031zbMATH Open1076.05035arXivmath/0112266OpenAlexW2136053434WikidataQ56766747 ScholiaQ56766747MaRDI QIDQ2575792FDOQ2575792

Louis Kauffman

Publication date: 6 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0112266




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Reformulating the map color theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575792)