{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:45Z","timestamp":1740107145222,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11361008"],"award-info":[{"award-number":["11361008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Guangxi Province (CN)","award":["2011GXNSFA018142"],"award-info":[{"award-number":["2011GXNSFA018142"]}]}],"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-1935-3","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T10:47:57Z","timestamp":1533811677000},"page":"1101-1110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Nonexistence of Some Generalized Folkman Numbers"],"prefix":"10.1007","volume":"34","author":[{"given":"Xiaodong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meilian","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanis\u0142aw","family":"Radziszowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"1935_CR1","first-page":"5","volume":"XXVII","author":"A Bikov","year":"2017","unstructured":"Bikov, A., Nenov, N.: The edge Folkman number \n                    \n                      \n                    \n                    $$F_e(3,3;4)$$\n                    \n                      \n                        \n                          \n                            F\n                            e\n                          \n                          \n                            (\n                            3\n                            ,\n                            3\n                            \u037e\n                            4\n                            )\n                          \n                        \n                      \n                    \n                   is greater than 19. Geombinatorics XXVII, 5\u201314 (2017)","journal-title":"Geombinatorics"},{"key":"1935_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jctb.2009.05.004","volume":"100","author":"A Dudek","year":"2010","unstructured":"Dudek, A., R\u00f6dl, V.: An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory Ser. B 100, 132\u2013140 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1935_CR3","first-page":"63","volume-title":"Ramsey Theory: Yesterday, Today and Tomorrow. Progress in Mathematics","author":"A Dudek","year":"2010","unstructured":"Dudek, A., R\u00f6dl, V.: On the function of Erd\u0151s and Rogers (survey). In: Soifer, A. (ed.) Ramsey Theory: Yesterday, Today and Tomorrow. Progress in Mathematics, vol. 285, pp. 63\u201376. Springer, Berlin (2010)"},{"key":"1935_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00493-011-2626-3","volume":"21","author":"A Dudek","year":"2011","unstructured":"Dudek, A., R\u00f6dl, V.: On \n                    \n                      \n                    \n                    $$K_s$$\n                    \n                      \n                        \n                          K\n                          s\n                        \n                      \n                    \n                  -free subgraphs in \n                    \n                      \n                    \n                    $$K_{s+k}$$\n                    \n                      \n                        \n                          K\n                          \n                            s\n                            +\n                            k\n                          \n                        \n                      \n                    \n                  -free graphs and vertex Folkman numbers. Combinatorica 21, 39\u201353 (2011)","journal-title":"Combinatorica"},{"key":"1935_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0118004","volume":"18","author":"J Folkman","year":"1970","unstructured":"Folkman, J.: Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Appl. Math. 18, 19\u201324 (1970)","journal-title":"SIAM J. Appl. Math."},{"key":"1935_CR6","doi-asserted-by":"publisher","first-page":"4263","DOI":"10.1016\/j.disc.2007.08.008","volume":"308","author":"N Konev","year":"2008","unstructured":"Konev, N.: A multiplicative inequality for vertex Folkman numbers. Discret. Math. 308, 4263\u20134266 (2008)","journal-title":"Discret. Math."},{"key":"1935_CR7","first-page":"61","volume":"88","author":"A Lange","year":"2014","unstructured":"Lange, A., Radziszowski, S., Xu, X.: Use of MAX-CUT for Ramsey arrowing of triangles. J. Comb. Math. Comb. Comput. 88, 61\u201371 (2014)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1935_CR8","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1137\/070686743","volume":"21","author":"L Lu","year":"2008","unstructured":"Lu, L.: Explicit construction of small Folkman graphs. SIAM J. Discret. Math. 21, 1053\u20131060 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"1935_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0012-365X(98)00083-1","volume":"188","author":"N Nenov","year":"1998","unstructured":"Nenov, N.: On the small graphs with chromatic number 5 without 4 cliques. Discret. Math. 188, 297\u2013298 (1998)","journal-title":"Discret. Math."},{"key":"1935_CR10","first-page":"59","volume":"95","author":"N Nenov","year":"2004","unstructured":"Nenov, N.: A generalization of a result of Dirac. Annu. Univ. Sofia Fac. Math. Inform. 95, 59\u201369 (2004)","journal-title":"Annu. Univ. Sofia Fac. Math. Inform."},{"issue":"3","key":"1935_CR11","first-page":"251","volume":"35","author":"N Nenov","year":"2009","unstructured":"Nenov, N.: On the vertex Folkman numbers \n                    \n                      \n                    \n                    $$F_v(2,\\ldots,2; q)$$\n                    \n                      \n                        \n                          \n                            F\n                            v\n                          \n                          \n                            (\n                            2\n                            ,\n                            \u2026\n                            ,\n                            2\n                            \u037e\n                            q\n                            )\n                          \n                        \n                      \n                    \n                  . Serdica Math. J. 35(3), 251\u2013271 (2009)","journal-title":"Serdica Math. J."},{"key":"1935_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0095-8956(76)90015-0","volume":"20","author":"J Ne\u0161et\u0159il","year":"1976","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: The Ramsey property for graphs with forbidden complete subgraphs. J. Comb. Theory Ser. B 20, 243\u2013249 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1935_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02579274","volume":"1","author":"J Ne\u0161et\u0159il","year":"1981","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. Combinatorica 1(2), 199\u2013202 (1981)","journal-title":"Combinatorica"},{"key":"1935_CR14","unstructured":"Radziszowski, S.: Small Ramsey numbers. Electron. J. Comb. Dyn. Surv. DS1, 104, revision #15 (2017). \n                    http:\/\/www.combinatorics.org"},{"key":"1935_CR15","unstructured":"Xu, X., Luo, H., Shao, Z.: Upper and lower bounds for \n                    \n                      \n                    \n                    $$F_v(4,4;5)$$\n                    \n                      \n                        \n                          \n                            F\n                            v\n                          \n                          \n                            (\n                            4\n                            ,\n                            4\n                            \u037e\n                            5\n                            )\n                          \n                        \n                      \n                    \n                  . Electron. J. Comb. N34, 17, 8 (2010). \n                    http:\/\/www.combinatorics.org"},{"key":"1935_CR16","first-page":"43","volume-title":"Graph Theory, Favorite Conjectures and Open Problems. Problem Books in Mathematics","author":"X Xu","year":"2016","unstructured":"Xu, X., Radziszowski, S.: On some open questions for Ramsey and Folkman numbers. In: Ralucca, G., Stephen, H., Craig, L. (eds.) Graph Theory, Favorite Conjectures and Open Problems. Problem Books in Mathematics, vol. 1, pp. 43\u201362. Springer, Berlin (2016)"},{"key":"1935_CR17","first-page":"187","volume":"81","author":"X Xiaodong","year":"2010","unstructured":"Xiaodong, X., Shao, Z.: On the lower bound for \n                    \n                      \n                    \n                    $$F_v(k, k;k+1)$$\n                    \n                      \n                        \n                          \n                            F\n                            v\n                          \n                          \n                            (\n                            k\n                            ,\n                            k\n                            \u037e\n                            k\n                            +\n                            1\n                            )\n                          \n                        \n                      \n                    \n                   and \n                    \n                      \n                    \n                    $$F_e(3,4;5)$$\n                    \n                      \n                        \n                          \n                            F\n                            e\n                          \n                          \n                            (\n                            3\n                            ,\n                            4\n                            \u037e\n                            5\n                            )\n                          \n                        \n                      \n                    \n                  . Util. Math. 81, 187\u2013192 (2010)","journal-title":"Util. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1935-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1935-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1935-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T22:42:06Z","timestamp":1569192126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1935-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1935"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1935-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"17 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}