Eigenvalues and homology of flag complexes and vector representations of graphs

The flag complex of a graph G = (V, E) is the simplicial complex X(G) on the vertex set V whose simplices are subsets of V which span complete subgraphs of G. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following: Theorem: Let lambda(2)(G) denote the second smallest eigenvalue of the Laplacian of G. If lambda(2)(G) > k/k+1 vertical bar V vertical bar then (H) over tilde (k)(X(G); R) = 0. Applications include a lower bound on the homological connectivity of the independent sets complex I(G), in terms of a new graph domination parameter Gamma(G) defined via certain vector representations of G. This in turns implies Hall type theorems for systems of disjoint representatives in hypergraphs.