3 papers
math.CO2025
Hoffman-London graphs: When paths minimize -colorings among trees
David Galvin, Phillip Marmorino, Emily McMillon +2
Given a graph and a target graph , an -coloring of is an adjacency-preserving vertex map from to . The number of -colorings of , , has been st…
math.CO2025
Long paths need not minimize -colorings among trees
David Galvin, Emily McMillon, JD Nir +1
Given a graph and a target graph , an -coloring of is an adjacency-preserving vertex map from to . By appropriate choice of , these colorings can express, f…
math.CO2025
Characterizing Graphs as Algebraic Squares
Karen L. Collins, David Galvin, Christine A. Kelley +2
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 homomorphi…