Vertex decomposable graphs and obstructions to shellability

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no chordless 4-cycles are shellable and sequentially Cohen-Macaulay. We use this result to characterize the obstructions to shellability in flag complexes, extending work of Billera, Myers, and Wachs. We also show how vertex decomposability may be used to show that certain graph constructions preserve shellability.Comment: 13 pages, 3 figures. v2: Improved exposition, added Section 5.2 and additional references. v3: minor corrections for publicatio

Topological representation of matroids from diagrams of spaces

Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the construction is not explicit. Anderson later provided an explicit construction, but had to use cell complexes of high dimensions that are homotopy equivalent to lower dimensional spheres. Using diagrams of spaces we give an explicit construction of arrangements in the right dimensions. Swartz asked if it is possible to arrange spheres of codimension two, and we provide a construction for any codimension. We also show that all matroids, and not only tropical oriented matroids, have a pseudo-tropical representation. We determine the homotopy type of all the constructed arrangements.Comment: 18 pages, 6 figures. Some more typos fixe