Characterizing Graphs as Algebraic Squares
Combinatorics
2025-10-08 v1
Abstract
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective and focuses on the graph properties of arbitrary square graphs, not only those relevant to homomorphism conjectures and theorems. We develop a set of necessary and/or sufficient conditions for a graph to be square. We apply these conditions to categorize several classical families of graphs as square or not. In addition, we create infinite families of square graphs by proving that joins and Cartesian, direct, strong, and lexicographic products of square graphs with arbitrary graphs are square.
Cite
@article{arxiv.2510.05372,
title = {Characterizing Graphs as Algebraic Squares},
author = {Karen L. Collins and David Galvin and Christine A. Kelley and Emily McMillon and Amanda Redlich},
journal= {arXiv preprint arXiv:2510.05372},
year = {2025}
}