abstract: In the study of subspace arrangements a common technique is to find a suitable combinatorial structure to model the behavior of the arrangement and then use the combinatorics to prove theorems. In this talk we will describe the intersection lattice of an arrangement and edge-colored hypergraphs as well as how they are used to study the topology of the complements of certain subspace arrangements. We will conclude with some recent results of mine and some joint work with Max Wakefield.