{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:05:58Z","timestamp":1709813158380},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00493-012-2696-x","type":"journal-article","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T20:52:17Z","timestamp":1346532737000},"page":"451-471","source":"Crossref","is-referenced-by-count":13,"title":["The Bollob\u00e1s-Thomason conjecture for 3-uniform hypergraphs"],"prefix":"10.1007","volume":"32","author":[{"given":"John","family":"Haslegrave","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,2]]},"reference":[{"key":"2696_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(97)00041-1","volume":"181","author":"N. Alon","year":"1998","unstructured":"N. Alon and E. Halperin: Bipartite subgraphs of integer weighted graphs, Discrete Math. 181 (1998), 19\u201329.","journal-title":"Discrete Math."},{"key":"2696_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","first-page":"xiv+394","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"B. Bollob\u00e1s: Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag, New York, 1998. xiv+394."},{"key":"2696_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, B. Reed and A. Thomason: An extremal function for the achromatic number, in Graph Structure Theory (Seattle, WA, 1991), 161\u2013165, Contemp. Math. 147, Amer. Math. Soc., Providence, RI, 1993.","DOI":"10.1090\/conm\/147\/01171"},{"key":"2696_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1006\/jcta.1996.2744","volume":"78","author":"B. Bollob\u00e1s","year":"1997","unstructured":"B. Bollob\u00e1s and A.D. Scott: Judicious partitions of hypergraphs, J. Combin. Theory Ser. A 78 (1997), 15\u201331.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2696_CR5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s004939970002","volume":"19","author":"B. Bollob\u00e1s","year":"1999","unstructured":"B. Bollob\u00e1s and A.D. Scott: Exact bounds for judicious partitions of graphs, Combinatorica 19 (1999), 473\u2013486.","journal-title":"Combinatorica"},{"key":"2696_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/eujc.1998.0266","volume":"21","author":"B. Bollob\u00e1s","year":"2000","unstructured":"B. Bollob\u00e1s and A.D. Scott: Judicious partitions of 3-uniform hypergraphs, European J. Combin. 21 (2000), 289\u2013300.","journal-title":"European J. Combin."},{"key":"2696_CR7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B. Bollob\u00e1s","year":"2002","unstructured":"B. Bollob\u00e1s and A.D. Scott: Problems and results on judicious partitions, Random Structures Algorithms 21 (2002), 414\u2013430.","journal-title":"Random Structures Algorithms"},{"key":"2696_CR8","first-page":"185","volume":"10","author":"B. Bollob\u00e1s","year":"2002","unstructured":"B. Bollob\u00e1s and A.D. Scott: Better bounds for Max Cut, in Contemporary Combinatorics, Bolyai Soc. Math. Stud. 10 (2002), 185\u2013246.","journal-title":"Contemporary Combinatorics"},{"key":"2696_CR9","unstructured":"J. Haslegrave: Judicious partitions of uniform hypergraphs, preprint."},{"key":"2696_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01285820","volume":"12","author":"T. D. Porter","year":"1992","unstructured":"T. D. Porter: On a bottleneck bipartition conjecture of Erd\u0151s, Combinatorica 12 (1992), 317\u2013321.","journal-title":"Combinatorica"},{"key":"2696_CR11","first-page":"149","volume":"37","author":"T. D. Porter","year":"2001","unstructured":"T. D. Porter and B. Yang: Graph partitions II, J. Combin. Math. Combin. Comput. 37 (2001), 149\u2013158.","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2696_CR12","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1017\/CBO9780511734885.006","volume-title":"Surveys in Combinatorics 2005","author":"A.D. Scott","year":"2005","unstructured":"A.D. Scott, Judicious partitions and related problems, in Surveys in Combinatorics 2005, London Math. Soc. Lecture Note Ser., 327, Cambridge Univ. Press, Cambridge, 2005, 95\u2013117."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2696-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2696-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2696-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T09:06:23Z","timestamp":1562144783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2696-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["2696"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2696-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}