Graph colorings, flows and arithmetic Tutte polynomial
Michele D'Adderio, Luca Moci

TL;DR
This paper introduces arithmetic colorings and flows on labeled graphs, linking their polynomials to the arithmetic Tutte polynomial, thereby generalizing classical graph theory results.
Contribution
It extends the concepts of colorings and flows to an arithmetic setting and connects their polynomials to the arithmetic Tutte polynomial, broadening classical graph theory.
Findings
Arithmetic chromatic and flow polynomials are specializations of the arithmetic Tutte polynomial.
Generalizes classical Tutte polynomial results to arithmetic colorings and flows.
Provides a unified framework for graph invariants with arithmetic structures.
Abstract
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and arithmetic flow polynomial are given by suitable specializations of the associated arithmetic Tutte polynomial, generalizing classical results of Tutte.
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 · Mathematical Dynamics and Fractals · Limits and Structures in Graph Theory
