{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:20:47Z","timestamp":1777414847102,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T00:00:00Z","timestamp":1448668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00493-014-3219-8","type":"journal-article","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T00:18:22Z","timestamp":1448669902000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Sparse hypergraphs with low independence number"],"prefix":"10.1007","volume":"37","author":[{"given":"Jeff","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"3219_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02579451","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, P. Erd\u0151s, J. Koml\u00f3s and E. Szemer\u00e9di: On Tur\u00e1n's theorem for sparse graphs, Combinatorica\n1 (1981), 313\u2013317.","journal-title":"Combinatorica"},{"key":"3219_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, J. Koml\u00f3s, J. Pintz, J. Spencer and E. Szemer\u00e9di: Extremal uncrowded hypergraphs, J. Combin. Theory Ser. A\n32 (1982), 321\u2013335.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3219_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0195-6698(81)80014-5","volume":"2","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di: A dense infinite Sidon sequence, European J. Combin.\n2 (1981), 1\u201311.","journal-title":"European J. Combin."},{"key":"3219_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/rsa.10102","volume":"23","author":"N. Alon","year":"2003","unstructured":"N. Alon, T. Jiang, Z. Miller and D. Pritikin: Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints, Random Structures Algorithms\n23 (2003), 409\u2013433.","journal-title":"Random Structures Algorithms"},{"key":"3219_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/rsa.20298","volume":"36","author":"T. Bohman","year":"2010","unstructured":"T. Bohman, A. Frieze and D. Mubayi: Coloring H-free hypergraphs, Random Structures Algorithms\n36 (2010), 11\u201325.","journal-title":"Random Structures Algorithms"},{"key":"3219_CR6","volume-title":"List coloring triangle-free hypergraphs","author":"J. Cooper","year":"2013","unstructured":"J. Cooper and D. Mubayi: List coloring triangle-free hypergraphs, (submitted) (2013)."},{"key":"3219_CR7","first-page":"187","volume-title":"Bolyai Soc. Math. Stud.","author":"D. Caen de","year":"1994","unstructured":"D. de\nCaen: The current status of Tur\u00e1n's problem on hypergraphs, Extremal problems for finite sets (Visegr\u00e1d, 1991), Bolyai Soc. Math. Stud., vol. 3, J\u00e1nos Bolyai Math. Soc., Budapest, 1994, 187\u2013197."},{"key":"3219_CR8","first-page":"609","volume":"10","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s and L. Lov\u00e1sz: Problems and results on 3-chromatic hypergraphs and some related questions, In finite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. II, North-Holland, Amsterdam, 1975, 609\u2013627. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10.","journal-title":"finite and finite sets"},{"key":"3219_CR9","first-page":"27","volume":"15","author":"A. Frieze","year":"2008","unstructured":"A. Frieze and D. Mubayi: On the chromatic number of simple triangle-free triple systems, Electron. J. Combin.\n15 (2008), Research Paper 121, 27.","journal-title":"Electron. J. Combin."},{"key":"3219_CR10","volume-title":"J. Combin. Theory. Ser. B","author":"A. Frieze","year":"2008","unstructured":"A. Frieze and D. Mubayi: Coloring simple hypergraphs, J. Combin. Theory. Ser. B (to appear). 2008"},{"key":"3219_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1112\/jlms\/s2-25.1.13","volume":"25","author":"J. Koml\u00f3s","year":"1982","unstructured":"J. Koml\u00f3s, J. Pintz and E. Szemer\u00e9di: A lower bound for Heilbronn's problem, J. London Math. Soc. (2) 25 (1982), 13\u201324.","journal-title":"J. London Math. Soc."},{"key":"3219_CR12","volume-title":"Random Structures Algorithms","author":"A. Kostochka","year":"1982","unstructured":"A. Kostochka, D. Mubayi and J. Verstraete: On independent sets in hypergraphs, Random Structures Algorithms (to appear) 1982."},{"key":"3219_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1017\/S0963548304006625","volume":"14","author":"H. Lefmann","year":"2005","unstructured":"H. Lefmann: Sparse parity-check matrices over GF(q), Combin. Probab. Comput.\n14 (2005), 147\u2013169.","journal-title":"Combin. Probab. Comput."},{"key":"3219_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.aim.2006.11.013","volume":"215","author":"D. Mubayi","year":"2007","unstructured":"D. Mubayi: An intersection theorem for four sets, Adv. Math.\n215 (2007), 601\u2013615.","journal-title":"Adv. Math."},{"key":"3219_CR15","first-page":"167","volume":"21","author":"K. T. Phelps","year":"1986","unstructured":"K. T. Phelps and V. R\u00f6dl: Steiner triple systems with minimum independence number, Ars Combin. 21 (1986), 167\u2013172.","journal-title":"Ars Combin"},{"key":"3219_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/rsa.3240070305","volume":"7","author":"J. B. Shearer","year":"1995","unstructured":"J. B. Shearer: On the independence number of sparse graphs, Random Structures Algorithms\n7 (1995), 269\u2013271.","journal-title":"Random Structures Algorithms"},{"key":"3219_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J. Spencer","year":"1972","unstructured":"J. Spencer: Turan's theorem for k-graphs, Discrete Math. 2 (1972), 183\u2013186.","journal-title":"Discrete Math"},{"key":"3219_CR18","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"P. Tur\u00e1n: On an extremal problem in graph theory (in hungarian), Math. Fiz. Lapok\n48 (1941), 436\u2013452.","journal-title":"Math. Fiz. Lapok"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3219-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3219-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3219-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3219-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:51Z","timestamp":1559079171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3219-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,28]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["3219"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3219-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,28]]}}}