Graphical Arrangements of Compressed Graphs

Abstract

Abstract.We show that if a graph G is compressed, then the proper part of the intersection poset of the corresponding graphical arrangement AG has the homotopy type of a wedge of spheres. Furthermore, we also indicate the number of spheres in the wedge, based on the number of adjacent edges of vertices in G.