Domination numbers, homology and hypergraph matching

The homological Hall lemma is a topological tool that has recently been used to derive Hall type theorems for systems of disjoint representatives in hypergraphs.

After outlining the general method, we.ll describe one such theorem in some detail. The main ingredients in the proof are:

1) A relation between the spectral gap of a graph and the topological connectivity of its flag complex.

2) A new graph domination parameter defined via certain vector representations of the graph.

Joint work with R. Aharoni and E. Berger