Hypergraph decompositions and their applications
Speaker: Peter Keevash, Oxford Title: Hypergraph decompositions and their applications Abstract: Many combinatorial objects can be thought of as a hypergraph decomposition, i.e. a partition of (the edge set of) one hypergraph into (the edge sets of) copies of some other hypergraphs. For example, a Steiner Triple System is equivalent to a decomposition of a complete graph […]