From the Coxeter graph to the Klein graph
Italo J. Dejter

TL;DR
This paper constructs the Klein cubic graph from the Coxeter cubic graph using a novel 'zipping' process on cycles, revealing its embedding into a 3-torus and its relation to the Klein quartic graph.
Contribution
It introduces a new method to derive the Klein cubic graph from the Coxeter graph via cycle 'zipping' and explores its embedding and duality properties.
Findings
Klein cubic graph obtained from Coxeter graph through cycle zipping.
Embedding of the Klein cubic graph into a 3-torus as the Klein map.
Identification of the dual graph as the Klein quartic graph.
Abstract
We show that the 56-vertex Klein cubic graph can be obtained from the 28-vertex Coxeter cubic graph by 'zipping' adequately the squares of the 24 7-cycles of endowed with an orientation obtained by considering as a -ultrahomogeneous digraph, where is the collection formed by both the oriented 7-cycles and the 2-arcs that tightly fasten those in . In the process, it is seen that is a -ultrahomogeneous (undirected) graph, where is the collection formed by both the 7-cycles and the 1-paths that tightly fasten those in . This yields an embedding of into a 3-torus which forms the Klein map of Coxeter notation . The dual graph of in is the distance-regular Klein quartic graph, with corresponding dual map of Coxeter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Finite Group Theory Research · Algebraic structures and combinatorial models
