01993cam  22003978i 450000100090000000300050000900500170001400600190003100700150005000800410006502000270010604000290013305000240016208200150018610000360020124501060023726400710034330000520041433600260046633700280049233800270052049000740054750000670062150400660068850503120075450600500106653300950111653800360121158800470124765000170129465000210131170000380133277601330137085600440150385600480154718272390RPAM20170613145118.0m      b    001 0 cr/|||||||||||170613s2014    riu     ob    001 0 eng    a9781470419660 (online)  aDLCbengcDLCerdadRPAM00aQA166.23b.K44 201400a511/.52231 aKeevash, Peter,d1978-eauthor.12aA geometric theory for hypergraph matching /h[electronic resource] cPeter Keevash, Richard Mycroft. 1aProvidence, Rhode Island :bAmerican Mathematical Society,c[2014]  a1 online resource (v, 95 pages : illustrations)  atextbtxt2rdacontent  aunmediatedbn2rdamedia  avolumebnc2rdacarrier0 aMemoirs of the American Mathematical Society, x1947-6221 ; vv. 1098  a"January 2015, volume 233, number 1098 (fourth of 6 numbers)."  aIncludes bibliographical references ( pages 93-95) and index.00tChapter 1. IntroductiontChapter 2. Results and examplestChapter 3. Geometric MotifstChapter 4. TransferralstChapter 5. Transferrals via the minimum degree sequencetChapter 6. Hypergraph Regularity TheorytChapter 7. Matchings in $k$-systemstChapter 8. Packing TetrahedratChapter 9. The general theory1 aAccess is restricted to licensed institutions  aElectronic reproduction.bProvidence, Rhode Island :cAmerican Mathematical Society.d2015  aMode of access : World Wide Web  aDescription based on print version record. 0aHypergraphs. 0aMatching theory.1 aMycroft, Richard,d1985-eauthor.0 iPrint version: aKeevash, Peter, 1978-tgeometric theory for hypergraph matching /w(DLC)   2014033269x0065-9266z97814704096544 3Contentsuhttp://www.ams.org/memo/1098/4 3Contentsuhttps://doi.org/10.1090/memo/1098