Geometric theory for hypergraph matching / Peter Keevash and Richard Mycroft.
Material type: TextSeries: Memoirs of the American Mathematical Society ; v 233, no 1098.Publication details: Providence : American Mathematical Society, 2015.Description: v, 95 p. : illustrations ; 26 cmISBN:- 9781470409654 (alk. paper)
- 510 23 Am512
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 510 Am512 (Browse shelf(Opens below)) | Available | 136693 |
Includes bibliographical references.
1. Introduction --
2. Results and examples --
3. Geometric motifs --
4. Transferrals --
5. Transferrals via the minimum degree sequence --
6. Hypergraph regularity theory --
7. Matchings in k-systems --
8. Packing tetrahedra --
9. The general theory --
Bibliography.
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.
There are no comments on this title.