{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T08:24:49Z","timestamp":1747383889991},"reference-count":17,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2016,5]]},"abstract":"<jats:p>We give an easy method for constructing containers for simple hypergraphs. The method also has consequences for non-simple hypergraphs. Some applications are given; in particular, a very transparent calculation is offered for the number of <jats:italic>H<\/jats:italic>-free hypergraphs, where <jats:italic>H<\/jats:italic> is some fixed uniform hypergraph.<\/jats:p>","DOI":"10.1017\/s096354831500022x","type":"journal-article","created":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T06:42:08Z","timestamp":1439793728000},"page":"448-459","source":"Crossref","is-referenced-by-count":8,"title":["Simple Containers for Simple Hypergraphs"],"prefix":"10.1017","volume":"25","author":[{"given":"DAVID","family":"SAXTON","sequence":"first","affiliation":[]},{"given":"ANDREW","family":"THOMASON","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"S096354831500022X_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548311000502"},{"key":"S096354831500022X_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33700-8_16"},{"key":"S096354831500022X_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005856"},{"key":"S096354831500022X_ref6","first-page":"19","volume-title":"Colloquio Internazionale sulle Teorie Combinatorie","author":"Erd\u0151s","year":"1976"},{"key":"S096354831500022X_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579292"},{"key":"S096354831500022X_ref2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004930070019","article-title":"The structure of hereditary properties and colourings of random graphs.","volume":"20","author":"Bollob\u00e1s","year":"2000","journal-title":"Combinatorica"},{"key":"S096354831500022X_ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10088"},{"key":"S096354831500022X_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.09.004"},{"key":"S096354831500022X_ref1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"S096354831500022X_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"S096354831500022X_ref16","unstructured":"Schacht M. Extremal results for random discrete structures. Submitted."},{"key":"S096354831500022X_ref15","article-title":"Hypergraph containers","author":"Saxton","journal-title":"Inventio Math"},{"key":"S096354831500022X_ref3","unstructured":"Conlon D. and Gowers W. T. Combinatorial theorems in sparse random sets. arXiv:1011.4310"},{"key":"S096354831500022X_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200906"},{"key":"S096354831500022X_ref11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"S096354831500022X_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030104"},{"key":"S096354831500022X_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2630-7"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354831500022X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T04:36:25Z","timestamp":1555648585000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354831500022X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S096354831500022X"],"URL":"https:\/\/doi.org\/10.1017\/s096354831500022x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,17]]}}}