Structure of the chromatic polynomial
Abstract
Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological data analysis techniques to explore the structure and properties of the point cloud consisting of the chromatic polynomials of graphs up to 10 crossings. Although chromatic, as well as the Tutte polynomial fail to distinguish graphs, according to a conjecture by Bollobas, Pebody and Riordan they approximate the space of random graphs. In this work we compare structures in the chromatic data revealed using filtered PCA and Ball Mapper techniques, and relate them with a range of numerical invariants for graphs.
Cite
@article{arxiv.2411.15088,
title = {Structure of the chromatic polynomial},
author = {Radmila Sazdanovic and Daniel Scofield},
journal= {arXiv preprint arXiv:2411.15088},
year = {2024}
}