Three-Colorings of Cubic Graphs and Tensor Operators
Rui Pedro Carpentier

TL;DR
This paper explores the algebraic representation of cubic graphs with free ends through tensor operators, building on Penrose's connection between edge 3-colorings and tensor algebras.
Contribution
It introduces an algebraic framework for cubic graphs with free ends, extending Penrose's work on tensor algebras and graph colorings.
Findings
Developed algebraic representations for cubic graphs with free ends
Extended Penrose's tensor algebra approach to non-planar graphs
Provided new tools for analyzing graph colorings algebraically
Abstract
Penrose's work \cite{8} established a connection between the edge 3-colorings of cubic planar graphs and tensor algebras. We exploit this point of view in order to get algebraic representations of the category of cubic graphs with free ends.
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
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
