{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":18,"n_cols":5,"rows_kept":18,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910816958903321"]
[null,null,"Autore",null,"Keevash Peter <1978->"]
[null,null,"Titolo",null,"A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , 2014"]
[{"$nulls":4},"©2014"]
[null,null,"ISBN",null,"1-4704-1966-1"]
[null,null,"Descrizione fisica",null,"1 online resource (95 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society, , 1947-6221 ; ; Volume 233, Number 1098"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Hypergraphs"]
[{"$nulls":4},"Matching theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"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\"\""]
[{"$nulls":4},"\"\"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\"\""]