1 paper · 1 filter
Sarah Crown Rundell
Let G be a simple graph with n vertices. The coloring complex Δ(G) was defined by Steingr\'ımsson, and the homology of Δ(G) was shown to be nonzero only in dimension n−3…