We examine complexes of graphs with the important property of being bipartite. Recall that a graph G is bipartite if G contains no cycles of odd length. Equivalently, G admits a bipartition (U, W), meaning that the vertex set V can be partitioned into two stable subsets U and W.
Unable to display preview. Download preview PDF.