2 papers
math.CO2026
Extremal diameters of 3-coloring graphs of trees
Shamil Asgarli, Sara Krehbiel, Simon MacLean +1
Given a tree , its 3-coloring graph has as vertices the proper 3-colorings of , with edges joining colorings that differ at exactly one vertex. We call the…
math.RT2019
On the classification of higher Auslander algebras for Nakayama algebras
Dag Oskar Madsen, Rene Marczinzik, Gjergji Zaimi
We give new improved bounds for the dominant dimension of Nakayama algebras and use those bounds to give a classification of Nakayama algebras with simple modules that are high…