Wyniki wyszukiwania:

The authors develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: `space barriers' from convex geometry, and `divisibility barriers' from arithmetic lattice-based constructions. To formulate precise results, they introduce the setting of simplicial complexes with minimum degree sequences, which is a generalisation of the usual minimum degree condition. They determine the essentially best possible minimum degree sequence for finding an almost...

The eight articles in this book provide a valuable survey of the present state of knowledge in combinatorics. Written by leading experts in the field, they provide expanded accounts of plenary seminars given at the British Combinatorial Conference in July 2019.