Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem

DOI10.1007/s10801-015-0643-9zbMath1337.05038OpenAlexW2284269730MaRDI QIDQ289030

Ryan Hicks, Kurt Virgin, John R. Donnelly

Publication date: 27 May 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-015-0643-9

zbMATH Keywords

Thompson's groupbinary treesfour-color theorem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Coloring of graphs and hypergraphs (05C15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Map coloring and the vector cross product
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Introductory notes on Richard Thompson's groups
• Minimal length elements of Thompson's group \(F\)
• Restricted rotation distance between binary trees.
• COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA

This page was built for publication: Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem