{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:59:36Z","timestamp":1742961576799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_34","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"412-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Small Ramsey Numbers on Hypergraphs"],"prefix":"10.1007","author":[{"given":"S.","family":"Cliff Liu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","key":"34_CR1","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1090\/S0894-0347-09-00645-6","volume":"23","author":"D Conlon","year":"2010","unstructured":"Conlon, D., Fox, J., Sudakov, B.: Hypergraph ramsey numbers. J. Am. Math. Soc. 23(1), 247\u2013266 (2010)","journal-title":"J. Am. Math. Soc."},{"issue":"1\u20132","key":"34_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01886396","volume":"16","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., Hajnal, A., Rado, R.: Partition relations for cardinal numbers. Acta Mathematica Hungarica 16(1\u20132), 93\u2013196 (1965)","journal-title":"Acta Mathematica Hungarica"},{"issue":"5","key":"34_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1090\/S0002-9904-1956-10036-0","volume":"62","author":"P Erd\u00f6s","year":"1956","unstructured":"Erd\u00f6s, P., Rado, R.: A partition calculus in set theory. Bull. Am. Math. Soc. 62(5), 427\u2013489 (1956)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"010501","DOI":"10.1103\/PhysRevLett.108.010501","volume":"108","author":"F Gaitan","year":"2012","unstructured":"Gaitan, F., Clark, L.: Ramsey numbers and adiabatic quantum computing. Phys. Rev. Lett. 108(1), 010501 (2012)","journal-title":"Phys. Rev. Lett."},{"key":"34_CR6","volume-title":"Ramsey Theory","author":"RL Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory, vol. 20. Wiley, New York (1990)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-40970-2_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"MJH Heule","year":"2016","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the boolean pythagorean triples problem via cube-and-conquer. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 228\u2013245. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_15"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Liu, S., Papakonstantinou, P.A.: Local search for hard SAT formulas: the strength of the polynomial law. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 732\u2013738 (2016)","DOI":"10.1609\/aaai.v30i1.10083"},{"key":"34_CR9","unstructured":"McKay, B.D., Radziszowski, S.P.: The first classical ramsey number for hypergraphs is computed. In: Proceedings of the Second Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, vol. 1991, pp. 304\u2013308 (1991)"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jctb.1996.1741","volume":"69","author":"BD McKay","year":"1997","unstructured":"McKay, B.D., Radziszowski, S.P.: Subgraph counting identities and ramsey numbers. J. Comb. Theory Ser. B 69(2), 193\u2013209 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"34_CR11","unstructured":"Radziszowski, S.P., et al.: Small ramsey numbers. Electron. J. Combin. 1(7) (1994)"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0012-365X(90)90379-V","volume":"84","author":"A Shastri","year":"1990","unstructured":"Shastri, A.: Lower bounds for bi-colored quaternary ramsey numbers. Discrete Math. 84(2), 213\u2013216 (1990)","journal-title":"Discrete Math."},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(86)90102-0","volume":"42","author":"JB Shearer","year":"1986","unstructured":"Shearer, J.B.: Lower bounds for small diagonal ramsey numbers. J. Comb. Theory Ser. A 42(2), 302\u2013304 (1986)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"34_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1090\/S0894-0347-1988-0929498-X","volume":"1","author":"S Shelah","year":"1988","unstructured":"Shelah, S.: Primitive recursive bounds for van der waerden numbers. J. Am. Math. Soc. 1(3), 683\u2013697 (1988)","journal-title":"J. Am. Math. Soc."},{"issue":"1\u20133","key":"34_CR15","first-page":"250","volume":"270","author":"L Shi","year":"2003","unstructured":"Shi, L.: Upper bounds for ramsey numbers. Discrete Math. 270(1\u20133), 250\u2013264 (2003)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"34_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(95)00049-3","volume":"145","author":"E Song","year":"1995","unstructured":"Song, E., Ye, W., Liu, Y.: New lower bounds for ramsey number R (p, q; 4). Discrete Math. 145(1\u20133), 343\u2013346 (1995)","journal-title":"Discrete Math."},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"DAD Tompkins","year":"2005","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306\u2013320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_24"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:14:27Z","timestamp":1709824467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}