{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144809,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["No.11101256"],"award-info":[{"award-number":["No.11101256"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1911-y","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T09:50:43Z","timestamp":1530179443000},"page":"845-861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bounding the Independence Number in Some \n                \n                  \n                \n                $$(n,k,\\ell ,\\lambda )$$\n                \n                  \n                    \n                      (\n                      n\n                      ,\n                      k\n                      ,\n                      \u2113\n                      ,\n                      \u03bb\n                      )\n                    \n                  \n                \n              -Hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Fang","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi-Long","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"key":"1911_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M Ajtai","year":"1980","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: A note on Ramsey numbers. J. Comb. Theory. A 29, 354\u2013360 (1980)","journal-title":"J. Comb. Theory. A"},{"key":"1911_CR2","volume-title":"Handbook of Combinatorial Designs. Discrete Mathematics and its Applications","author":"CJ Colbourn","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs. Discrete Mathematics and its Applications. Chapman and Hall, FL (2007)"},{"key":"1911_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.4310\/JOC.2017.v8.n1.a4","volume":"8","author":"P Balister","year":"2017","unstructured":"Balister, P., Gerke, S., Mcdowell, A.: Adversarial resilience of matchings in bipartite random graphs. J. Combin. 8, 79\u201392 (2017)","journal-title":"J. Combin."},{"key":"1911_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis bases on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"1911_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Hajnal, A.: On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hung. 17, 61\u201399 (1966)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1911_CR6","first-page":"97","volume-title":"Some Unsolved Problems in Graph Theory and Combinatorial Analysis. Combinatorial Mathematics and its Applications (Proc. Conf. Oxford)","author":"P Erd\u0151s","year":"1969","unstructured":"Erd\u0151s, P.: Some Unsolved Problems in Graph Theory and Combinatorial Analysis. Combinatorial Mathematics and its Applications (Proc. Conf. Oxford), vol. 1971, pp. 97\u2013109. Academic Press, London (1969)"},{"issue":"2","key":"1911_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/S0963548312000557","volume":"22","author":"A Eustis","year":"2013","unstructured":"Eustis, A., Verstraete, J.: On the independence number of Steiner systems. Comb. Probab. Comput. 22(2), 241\u2013252 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"1911_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"M Habib","year":"1998","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B.: Probabilistic Methods for Algorithmic Discrete Mathematics. Springer, Berlin (1998)"},{"key":"1911_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of ComputerComputations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of ComputerComputations, pp. 85\u2013103. Plenum, New York (1972)"},{"unstructured":"Keevash, P.: The Existence of Designs. \n                    arXiv:1401.3665","key":"1911_CR10"},{"issue":"2","key":"1911_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1002\/rsa.20453","volume":"44","author":"A Kostochka","year":"2014","unstructured":"Kostochka, A., Mubayi, D., Verstra\u00ebte, J.: On independent sets in hypergraphs. Random Struct. Algorithm 44(2), 224\u2013239 (2014)","journal-title":"Random Struct. Algorithm"},{"key":"1911_CR12","first-page":"167","volume":"21","author":"KT Phelps","year":"1986","unstructured":"Phelps, K.T., R\u00f6dl, V.: Steiner triple systems with minimum independence number. Ars Combin. 21, 167\u2013172 (1986)","journal-title":"Ars Combin."},{"issue":"1","key":"1911_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/rsa.3240050117","volume":"5","author":"V R\u00f6dl","year":"1994","unstructured":"R\u00f6dl, V., \u0160inajov\u00e1, E.: Note on independent sets in Steiner systems. Random Struct. Algorithm 5(1), 183\u2013190 (1994)","journal-title":"Random Struct. Algorithm"},{"key":"1911_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(83)90273-X","volume":"46","author":"J Shearer","year":"1983","unstructured":"Shearer, J.: A note on the independence number of triangle-free graphs. Discret. Math. 46, 83\u201387 (1983)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1911-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T19:21:58Z","timestamp":1561663318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1911-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1911"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1911-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,6,28]]},"assertion":[{"value":"17 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}