{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:43:15Z","timestamp":1766306595342,"version":"3.48.0"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":261,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.208","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:28Z","timestamp":1762467208000},"page":"881-890","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hybrid reinforcement learning and classical graph checking approach for restricted and connected size Ramsey numbers of 3K2 and cycles"],"prefix":"10.1016","volume":"270","author":[{"given":"Tomasz","family":"Dzido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.09.208_bib1","doi-asserted-by":"crossref","unstructured":"Baskoro, E.T., Vetr\u00edk, T.: A note on the size Ramsey numbers for matchings versus cycles, Math. Bohem. 146(2) 229\u2013234 (2021)","DOI":"10.21136\/MB.2020.0174-18"},{"key":"10.1016\/j.procs.2025.09.208_bib2","unstructured":"Dzido, T.: Applying reinforcement learning to Ramsey problems. In: Miky\u0161ka, J., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M. (eds) Computational Science\u2013ICCS 2023. Lecture Notes in Computer Science, vol. 10476, pp. 589\u2013596. Springer, Cham (2023)."},{"key":"10.1016\/j.procs.2025.09.208_bib3","doi-asserted-by":"crossref","unstructured":"Dzido, T.: New results for some Tur\u00e1n problem instances obtained using the reinforcement learning technique. In Computational Collective Intelligence: 16th International Conference, ICCCI 2024, Leipzig, Germany, September 9\u201311, 2024, Proceedings, Part II. Springer-Verlag, Berlin, Heidelberg, 202\u2013214.","DOI":"10.1007\/978-3-031-70819-0_16"},{"key":"10.1016\/j.procs.2025.09.208_bib4","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Faudree, R.J.: Size Ramsey numbers involving matchings. In: Finite and Infinite Sets, pp. 247\u2013264. Elsevier, Amsterdam, The Netherlands (1984)","DOI":"10.1016\/B978-0-444-86893-0.50019-X"},{"key":"10.1016\/j.procs.2025.09.208_bib5","doi-asserted-by":"crossref","unstructured":"Faudree, R.J., Schelp, R.H., Sheehan, J.: Ramsey numbers for matchings. Discrete Mathematics 32 105\u2013123 (1980)","DOI":"10.1016\/0012-365X(80)90049-7"},{"key":"10.1016\/j.procs.2025.09.208_bib6","unstructured":"Gasarch, W.: Ramsey Theory Applications. https:\/\/www.cs.umd.edu\/~gasarch\/TOPICS\/ramsey\/ramsey.html, accessed 17 Mar 2025."},{"key":"10.1016\/j.procs.2025.09.208_bib7","doi-asserted-by":"crossref","unstructured":"McKay, B.D., Piperno, A.: Practical Graph Isomorphism, II. Journal of Symbolic Computation 60 94\u2013112 (2014)","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"10.1016\/j.procs.2025.09.208_bib8","doi-asserted-by":"crossref","unstructured":"Rahadjeng, B., Baskoro, E.T., Assiyatun H.: Connected size Ramsey number for matchings vs. small stars or cycles. Proc. Indian Acad. Sci. (Math. Sci.) 127(5) 787\u2013792 (2017)","DOI":"10.1007\/s12044-017-0366-z"},{"key":"10.1016\/j.procs.2025.09.208_bib9","unstructured":"Silaban, D.R., Baskoro, E.T., Uttunggadewa, S.: On the Restricted Size Ramsey Number Involving Matchings, submitted for publication."},{"key":"10.1016\/j.procs.2025.09.208_bib10","unstructured":"Wang, S., Song, R., Zhang, Y., Zhang, Y.: Connected size Ramsey numbers of matchings versus a small path or cycle. Preprint."},{"key":"10.1016\/j.procs.2025.09.208_bib11","doi-asserted-by":"crossref","unstructured":"Wijaya, K., Baskoro, E.T., Assiyatun, H., Suprijanto, D.: On Ramsey (mK2, H)-minimal graphs. Graphs and Combinatorics 33 233\u2013243 (2017)","DOI":"10.1007\/s00373-016-1748-1"},{"key":"10.1016\/j.procs.2025.09.208_bib12","unstructured":"Yow, K.S., Liao, N., Luo, S., Cheng, R., Ma, Ch., Han, X.: A Survey on Machine Learning Solutions for Graph Pattern Extraction https:\/\/arxiv.org\/abs\/2204.01057. Last accessed 12 Feb 2025"},{"key":"10.1016\/j.procs.2025.09.208_bib13","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Hao, J-K., Duval, B.: Reinforcement learning based local search for grouping problems: A case study on graph coloring. Expert Systems With Applications 64, 412\u2013422 (2016)","DOI":"10.1016\/j.eswa.2016.07.047"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925028789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925028789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:38:37Z","timestamp":1766306317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925028789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":13,"alternative-id":["S1877050925028789"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.208","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hybrid reinforcement learning and classical graph checking approach for restricted and connected size Ramsey numbers of 3K2 and cycles","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.208","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}