{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:17Z","timestamp":1740107117446,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11361008","11361008"],"award-info":[{"award-number":["11361008","11361008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Computing Research Association for the CIFellows Project","award":["CCF-2030859"],"award-info":[{"award-number":["CCF-2030859"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00373-023-02654-8","type":"journal-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T08:02:27Z","timestamp":1684915347000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Some Generalized Vertex Folkman Numbers"],"prefix":"10.1007","volume":"39","author":[{"given":"Zohair Raza","family":"Hassan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David E.","family":"Narv\u00e1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanis\u0142aw","family":"Radziszowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"key":"2654_CR1","unstructured":"Bikov, A.: Computation and Bounding of Folkman Numbers. PhD Thesis, Sofia University \u201cSt. Kliment Ohridski\u201d (2018). arXiv:1806.09601"},{"key":"2654_CR2","first-page":"35","volume":"77","author":"A Bikov","year":"2020","unstructured":"Bikov, A., Nenov, N.: On the independence number of $$(3,3)$$-Ramsey graphs and the Folkman number $$F_e(3,3;4)$$. Australas. J. Comb. 77, 35\u201350 (2020)","journal-title":"Australas. J. Comb."},{"key":"2654_CR3","unstructured":"Bohman, T., Keevash. P.: 3 Dynamic concentration of the triangle-free process. In: Ne\u0161et\u0159il, J., Pellegrini, M. (eds.), The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol. 16, Edizioni della Normale, Pisa. arXiv:1302.5963 (2013) (52\u201375, revised version (2019))"},{"key":"2654_CR4","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V.: The minimality of the Mycielski graph. Graphs and Combinatorics, Proceedings of the Capital Conference, George Washington University, Washington DC, 1973. Lecture Notes in Mathematics, vol. 406, pp. 243\u2013246. Springer, Berlin (1974)","DOI":"10.1007\/BFb0066446"},{"key":"2654_CR5","first-page":"13","volume":"58","author":"J Coles","year":"2006","unstructured":"Coles, J., Radziszowski, S.: Computing the Folkman Number $$F_v(2,2,3;4)$$. J. Comb. Math. Comb. Comput. 58, 13\u201322 (2006)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2654_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/10586458.2008.10129023","volume":"17","author":"A Dudek","year":"2008","unstructured":"Dudek, A., R\u00f6dl, V.: On the Folkman number $$f(2,3,4)$$. Exp. Math. 17, 63\u201367 (2008)","journal-title":"Exp. Math."},{"key":"2654_CR7","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 $$K_s$$-free subgraphs in $$K_{s+k}$$-free graphs and vertex Folkman numbers. Combinatorica 21, 39\u201353 (2011)","journal-title":"Combinatorica"},{"key":"2654_CR8","doi-asserted-by":"crossref","unstructured":"Fiz Pontiveros, G., Griffiths, S., Morris, R.: The triangle-free process and $$R(3,k)$$. Mem. Am. Math. Soc. 263(1274), 125 (2020). First version on arXiv:1302.6279 (2013)","DOI":"10.1090\/memo\/1274"},{"key":"2654_CR9","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. J. SIAM Appl. Math. 18, 19\u201324 (1970)","journal-title":"J. SIAM Appl. Math."},{"key":"2654_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/jgt.22467","volume":"93","author":"J Goedgebeur","year":"2020","unstructured":"Goedgebeur, J.: On minimal triangle-free 6-chromatic graphs. J. Graph Theory 93, 34\u201348 (2020)","journal-title":"J. Graph Theory"},{"key":"2654_CR11","doi-asserted-by":"crossref","unstructured":"Goedgebeur, J., Huang, S., Ju, Y., Merkel, O.: Colouring graphs with no induced six-vertex path or diamond. In: International Computing and Combinatorics Conference, COCOON: Tainan, pp. 319\u2013329. Springer, Taiwan (2021)","DOI":"10.1007\/978-3-030-89543-3_27"},{"key":"2654_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/jgt.3190190111","volume":"19","author":"T Jensen","year":"1995","unstructured":"Jensen, T., Royle, G.: Small graphs with chromatic number 5: a computer search. J. Graph Theory 19, 107\u2013116 (1995)","journal-title":"J. Graph Theory"},{"key":"2654_CR13","first-page":"241","volume":"110","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Liang, M., Xu, X.: Bounds for some generalized vertex Folkman numbers. J. Comb. Math. Comb. Comput. 110, 241\u2013247 (2019)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2654_CR14","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":"2654_CR15","first-page":"119","volume":"78","author":"J Lathrop","year":"2011","unstructured":"Lathrop, J., Radziszowski, S.: Computing the Folkman Number $$F_v(2,2,2,2,2;4)$$. J. Comb. Math. Comb. Comput. 78, 119\u2013128 (2011)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2654_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(00)00445-3","volume":"236","author":"T \u0141uczak","year":"2001","unstructured":"\u0141uczak, T., Ruci\u0144ski, A., Urba\u0144ski, S.: On minimal Folkman graphs (Graph Theory Conference, Kazimierz Dolny, 1997). Discrete Math. 236, 245\u2013262 (2001)","journal-title":"Discrete Math."},{"key":"2654_CR17","unstructured":"McKay, B.D.: nauty User\u2019s Guide (Version 2.7), the first nauty Technical Report TR-CS-90-02, Department of Computer Science, Australian National University (1990). The 2021 version of nauty software and documentation is available at http:\/\/cs.anu.edu.au\/~bdm\/nauty"},{"key":"2654_CR18","first-page":"1487","volume":"34","author":"N Nenov","year":"1981","unstructured":"Nenov, N.: An example of a 15-vertex Ramsey $$(3, 3)$$-graph with clique number 4 (in Russian). C. R. Acad. Bulg. Sci. 34, 1487\u20131489 (1981)","journal-title":"C. R. Acad. Bulg. Sci."},{"key":"2654_CR19","doi-asserted-by":"crossref","unstructured":"Nenov, N.: The chromatic number of any 10-vertex graph without 4-cliques is at most 4 (in Russian). C.R. Acad. Bulg. Sci. 37(3), 301\u2013304 (1984). See also letter to the editor, On the small graphs with chromatic number 5 without 4 cliques, Discrete Mathematics 188, 297\u2013298 (1998)","DOI":"10.1016\/S0012-365X(98)00083-1"},{"key":"2654_CR20","first-page":"15","volume":"94","author":"N Nenov","year":"2000","unstructured":"Nenov, N.: On a class of vertex Folkman graphs. Annu. Univ. Sofia Fac. Math. Inform. 94, 15\u201325 (2000)","journal-title":"Annu. Univ. Sofia Fac. Math. Inform."},{"key":"2654_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0012-365X(03)00134-1","volume":"271","author":"N Nenov","year":"2003","unstructured":"Nenov, N.: On the triangle vertex Folkman numbers. Discrete Math. 271, 327\u2013334 (2003)","journal-title":"Discrete Math."},{"issue":"3","key":"2654_CR22","first-page":"251","volume":"35","author":"N Nenov","year":"2009","unstructured":"Nenov, N.: On the vertex Folkman numbers $$F_v(2,\\cdots ,2; q)$$. Serdica Math. J. 35(3), 251\u2013271 (2009)","journal-title":"Serdica Math. J."},{"key":"2654_CR23","unstructured":"Nenov, N.: On the vertex Folkman numbers $$F_v(\\underbrace{2, \\cdots , 2}_r; r-1)$$ and $$F_v(\\underbrace{2, \\cdots , 2}_r; r-2)$$. Ann. Univ. Sofia Fac. Math. Inform. 101, 5\u201317 (2013). arXiv:0903.3151"},{"key":"2654_CR24","first-page":"85","volume":"17","author":"J Ne\u0161et\u0159il","year":"1976","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Partitions of vertices. Comment. Math. Univ. Carol. 17, 85\u201395 (1976)","journal-title":"Comment. Math. Univ. Carol."},{"key":"2654_CR25","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":"2654_CR26","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":"2654_CR27","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/rsa.20517","volume":"45","author":"M Picollelli","year":"2014","unstructured":"Picollelli, M.: The diamond-free process. Random Struct. Algorithms 45, 513\u2013551 (2014)","journal-title":"Random Struct. Algorithms"},{"key":"2654_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/(SICI)1097-0118(199909)32:1<41::AID-JGT4>3.0.CO;2-P","volume":"32","author":"K Piwakowski","year":"1999","unstructured":"Piwakowski, K., Radziszowski, S., Urba\u0144ski, S.: Computation of the Folkman number $$F_e(3,3;5)$$. J. Graph Theory 32, 41\u201349 (1999)","journal-title":"J. Graph Theory"},{"key":"2654_CR29","unstructured":"Radziszowski, S.: Unpublished results from computations (2010\u20132015)"},{"key":"2654_CR30","unstructured":"Radziszowski, S.: Small Ramsey Numbers. Electronic Journal of Combinatorics, Dynamic Survey DS1, revision #16, 116 (2021). http:\/\/www.combinatorics.org\/"},{"issue":"5","key":"2654_CR31","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.4153\/CJM-1992-064-7","volume":"44","author":"V R\u00f6dl","year":"1992","unstructured":"R\u00f6dl, V., Sauer, N.: The Ramsey property for families of graphs which exclude a given graph. Can. J. Math. 44(5), 1050\u20131060 (1992)","journal-title":"Can. J. Math."},{"key":"2654_CR32","doi-asserted-by":"crossref","unstructured":"Seidel, J.J.: Strongly regular graphs. In: Bollob\u00e1s, B. (ed.) Surveys in Combinatorics, 2nd edn, London Math. Soc. Lecture Note Series, vol. 38, pp. 157\u2013180. Cambridge U.P. (1979)","DOI":"10.1017\/CBO9780511662133.007"},{"key":"2654_CR33","doi-asserted-by":"crossref","unstructured":"Xu, X., Luo, H., Shao, Z.: Upper and lower bounds for $$F_v(4,4;5)$$. Electron. J. Comb. N34(17), 8 (2010). http:\/\/www.combinatorics.org","DOI":"10.37236\/483"},{"key":"2654_CR34","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s00373-018-1935-3","volume":"34","author":"X Xu","year":"2018","unstructured":"Xu, X., Liang, M., Radziszowski, S.: On the nonexistence of some generalized Folkman numbers. Graphs Comb. 34, 1101\u20131110 (2018)","journal-title":"Graphs Comb."},{"key":"2654_CR35","first-page":"187","volume":"81","author":"X Xu","year":"2010","unstructured":"Xu, X., Shao, Z.: On the lower bound for $$F_v(k, k;k+1)$$ and $$F_e(3,4;5)$$. Utilitas Math. 81, 187\u2013192 (2010)","journal-title":"Utilitas Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02654-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02654-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02654-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T11:30:33Z","timestamp":1691667033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02654-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2654"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02654-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,5,24]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflicts.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}