{"id":"https://openalex.org/W4415974873","doi":"https://doi.org/10.1016/j.procs.2025.09.208","title":"Hybrid reinforcement learning and classical graph checking approach for restricted and connected size Ramsey numbers of 3K2 and cycles","display_name":"Hybrid reinforcement learning and classical graph checking approach for restricted and connected size Ramsey numbers of 3K2 and cycles","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974873","doi":"https://doi.org/10.1016/j.procs.2025.09.208"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.208","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.208","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.208","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043423165","display_name":"Tomasz Dzido","orcid":"https://orcid.org/0000-0001-6712-8541"},"institutions":[{"id":"https://openalex.org/I4210125238","display_name":"Gdynia Maritime University","ror":"https://ror.org/02vscf791","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210125238"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Tomasz Dzido","raw_affiliation_strings":["Faculty of Computer Science, Gdynia Maritime University, Morska 81-87, 81-225 Gdynia, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Gdynia Maritime University, Morska 81-87, 81-225 Gdynia, Poland","institution_ids":["https://openalex.org/I4210125238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043423165"],"corresponding_institution_ids":["https://openalex.org/I4210125238"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52432432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"881","last_page":"890"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.3546999990940094,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.3546999990940094,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.20080000162124634,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.13169999420642853,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ramseys-theorem","display_name":"Ramsey's theorem","score":0.7883999943733215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5598000288009644},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.44179999828338623},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4000999927520752},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.39149999618530273},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.3752000033855438},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.7883999943733215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6355999708175659},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5598000288009644},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.531000018119812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5076000094413757},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.44179999828338623},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4000000059604645},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.39149999618530273},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.35850000381469727},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30660000443458557},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C94020503","wikidata":"https://www.wikidata.org/wiki/Q12916","display_name":"Real number","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.208","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.208","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.208","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.208","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W129769633","https://openalex.org/W1990600049","https://openalex.org/W1995556192","https://openalex.org/W2322334644","https://openalex.org/W2560239338","https://openalex.org/W2770495287","https://openalex.org/W3034048934","https://openalex.org/W4402269122"],"related_works":[],"abstract_inverted_index":{"Given":[0],"simple":[1],"graphs":[2],"F,":[3,23],"G,":[4],"and":[5,99,146,168,217],"H,":[6],"we":[7,85,138],"say":[8],"that":[9,49,77,123,192],"F":[10,76,79,111],"\u2192":[11,58,80],"(G,":[12,59,81],"H)":[13,42,66],"if,":[14],"for":[15,142,151,213,233],"any":[16],"red-blue":[17],"coloring":[18],"of":[19,22,30,36,71,90,116,133,158,162,185],"the":[20,44,50,68,94,100,109,119,124,144,160,215,231],"edges":[21,72],"there":[24],"exists":[25],"either":[26],"a":[27,33,74,113,130,183,194,202],"red-colored":[28],"copy":[29,35],"G":[31],"or":[32],"blue-colored":[34],"H.":[37],"The":[38,61,105,156,178],"Ramsey":[39,63,92,97,103,125,149],"number":[40,64,70,98],"r(G,":[41],"is":[43,67,165],"smallest":[45,69],"integer":[46],"r":[47,54,57],"such":[48,163],"complete":[51],"graph":[52,75,110,186],"K":[53,56],"satisfies":[55,78],"H).":[60,82],"size":[62,91,96,102,148],"r\u02c6(G,":[65],"in":[73,129,175,226],"In":[83,135],"addition,":[84],"distinguish":[86],"two":[87],"key":[88],"variations":[89],"numbers:":[93],"restricted":[95,106,145,216],"connected":[101,120,131,147,218],"number.":[104],"version":[107],"limits":[108],"to":[112],"certain":[114],"class":[115],"graphs,":[117],"while":[118],"variant":[121],"requires":[122],"configuration":[126],"must":[127,181],"appear":[128],"subgraph":[132],"F.":[134],"this":[136,176,228],"paper,":[137],"investigate":[139],"algorithmic":[140],"techniques":[141],"computing":[143],"numbers":[150,164],"3K":[152],"2":[153],"versus":[154],"cycles.":[155],"problem":[157],"determining":[159],"values":[161,212],"an":[166,190,223],"open":[167],"challenging":[169],"problem,":[170],"with":[171,201],"very":[172],"little":[173],"known":[174],"area.":[177],"developed":[179],"algorithms":[180],"utilize":[182],"variety":[184],"properties.":[187],"We":[188],"introduce":[189],"approach":[191],"combines":[193],"reinforcement":[195],"learning-based":[196],"local":[197],"search":[198],"(RLS)":[199],"method":[200],"verification":[203],"procedure":[204],"using":[205],"Nauty.":[206],"Our":[207],"results":[208],"provide":[209],"new":[210],"exact":[211],"both":[214],"cases.":[219],"These":[220],"findings":[221],"represent":[222],"initial":[224],"step":[225],"exploring":[227],"topic,":[229],"laying":[230],"groundwork":[232],"further":[234],"research.":[235]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}