Abstract
We use a result of Kauffman to explore the connection between Richard Thompson’s Group F and the four-color theorem.
Similar content being viewed by others
References
Appel, K., Haken, W.: Every planar map is four colorable. I. Discharging. Ill. J. Math. 21(3), 429–490 (1977)
Appel, K., Haken, W.: Every planar map is four colorable. II. Reducibility. Ill. J. Math. 21(3), 491–567 (1977)
Bowlin, G., Brin, M.: Coloring planar graphs via colored paths in the associahedra. Int. J. Algebra Comput. 23, 1337–1418 (2013)
Cannon, J.W., Floyd, W.J., Parry, W.R.: Introductory notes on Richard Thompson’s groups. Enseign. Math. (2) 42(3–4), 215–256 (1996)
Cleary, S.: Restricted rotation distance between binary trees. Inf. Process. Lett. 84, 333–338 (2002)
Fordham, S.B.: Minimal length elements of Thompson’s group F. Geom. Dedicata 99, 179–220 (2003)
Kauffman, L.H.: Map coloring and the vector cross product. J. Combin. Theory Ser. B 48(2), 145–154 (1990)
Thomas, R.: An update on the four-color theorem. Not. Am. Math. Soc. 45(7), 848–859 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Donnelly, J., Hicks, R. & Virgin, K. Generators and normal forms of Richard Thompson’s group F and the four-color theorem. J Algebr Comb 43, 485–493 (2016). https://doi.org/10.1007/s10801-015-0643-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-015-0643-9