02643nam 2200565 450 991079701860332120180731044934.01-4704-1966-1(CKB)3710000000393430(EBL)3114346(SSID)ssj0001366809(PQKBManifestationID)11900053(PQKBTitleCode)TC0001366809(PQKBWorkID)11439094(PQKB)10856748(MiAaPQ)EBC3114346(RPAM)18272390(PPN)185739008(EXLCZ)99371000000039343020150415h20142014 uy 0engur|n|---|||||txtccrA geometric theory for hypergraph matching /Peter Keevash, Richard MycroftProvidence, Rhode Island :American Mathematical Society,2014.©20141 online resource (95 p.)Memoirs of the American Mathematical Society,1947-6221 ;Volume 233, Number 1098Description based upon print version of record.1-4704-0965-8 Includes bibliographical references.""4.2. Transferral digraphs""""4.3. Completion of the transferral digraph""; ""Chapter 5. Transferrals via the minimum degree sequence""; ""Chapter 6. Hypergraph Regularity Theory""; ""6.1. Hypergraph regularity""; ""6.2. The Regular Approximation Lemma""; ""6.3. The hypergraph blowup lemma""; ""6.4. Reduced -systems""; ""6.5. Proof of Lemma 5.5""; ""Chapter 7. Matchings in -systems""; ""7.1. Fractional perfect matchings""; ""7.2. Almost perfect matchings""; ""7.3. Perfect matchings""; ""Chapter 8. Packing Tetrahedra""; ""8.1. Packing to within a constant""""8.2. Properties of index vectors""""8.3. Divisibility barriers with two parts""; ""8.4. Divisibility barriers with more parts""; ""8.5. The main case of Theorem 1.1""; ""8.6. The case when 8 divides ""; ""8.7. Strong stability for perfect matchings""; ""Chapter 9. The general theory""; ""Acknowledgements""; ""Bibliography""; ""Back Cover""Memoirs of the American Mathematical Society ;Volume 233, Number 1098.HypergraphsMatching theoryHypergraphs.Matching theory.511/.5Keevash Peter1978-1494155Mycroft Richard1985-MiAaPQMiAaPQMiAaPQBOOK9910797018603321A geometric theory for hypergraph matching3717531UNINA