{"id":"https://openalex.org/W7130756844","doi":"https://doi.org/10.48550/arxiv.2602.17276","title":"RLGT: A reinforcement learning framework for extremal graph theory","display_name":"RLGT: A reinforcement learning framework for extremal graph theory","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7130756844","doi":"https://doi.org/10.48550/arxiv.2602.17276"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17276","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126492712","display_name":"Ivan Damnjanovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Damnjanovi\u0107, Ivan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126508885","display_name":"Uro\u0161 Milivojevi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Milivojevi\u0107, Uro\u0161","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126496523","display_name":"Irena \u0110or\u0111evi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u0110or\u0111evi\u0107, Irena","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126497084","display_name":"Dragan Stevanovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stevanovi\u0107, Dragan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5126492712"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.17810000479221344,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.17810000479221344,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.0828000009059906,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.08259999752044678,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.753600001335144},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.515500009059906},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4927999973297119},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.43459999561309814},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"Extremal graph theory","score":0.42730000615119934},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.38269999623298645},{"id":"https://openalex.org/keywords/spectral-graph-theory","display_name":"Spectral graph theory","score":0.3644999861717224},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.3366999924182892}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.753600001335144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4823000133037567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44510000944137573},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C12595997","wikidata":"https://www.wikidata.org/wiki/Q739245","display_name":"Extremal graph theory","level":5,"score":0.42730000615119934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4271000027656555},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.3644999861717224},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2903999984264374},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2888999879360199},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.28200000524520874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27459999918937683},{"id":"https://openalex.org/C92393732","wikidata":"https://www.wikidata.org/wiki/Q1790374","display_name":"Learning theory","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C140532419","wikidata":"https://www.wikidata.org/wiki/Q249748","display_name":"Spectral radius","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.26759999990463257},{"id":"https://openalex.org/C2779193601","wikidata":"https://www.wikidata.org/wiki/Q20026918","display_name":"Mathematical theory","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.258899986743927},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.2587999999523163}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17276","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17276","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17276","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17276","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reinforcement":[0,139],"learning":[1,8],"(RL)":[2],"is":[3],"a":[4,24,78,145,196],"subfield":[5],"of":[6,80,91,102,131,172],"machine":[7],"that":[9,14,149],"focuses":[10],"on":[11],"developing":[12],"models":[13],"can":[15,36],"autonomously":[16],"learn":[17],"optimal":[18],"decision-making":[19],"strategies":[20],"over":[21],"time.":[22],"In":[23,93],"recent":[25],"pioneering":[26],"paper,":[27],"Wagner":[28],"demonstrated":[29],"how":[30],"the":[31,63,89,98,120,126,151],"Deep":[32],"Cross-Entropy":[33],"RL":[34,71,147],"method":[35],"be":[37],"applied":[38],"to":[39,119,182],"tackle":[40],"various":[41,70],"problems":[42,81],"from":[43,82],"extremal":[44,83,122,188],"graph":[45,75,84,189],"theory":[46,85,190],"by":[47,66],"reformulating":[48],"them":[49],"as":[50],"combinatorial":[51],"optimization":[52],"problems.":[53],"Subsequently,":[54],"many":[55],"researchers":[56],"became":[57],"interested":[58],"in":[59,124,187],"refining":[60],"and":[61,115,134,154,160,167,180,195,198],"extending":[62],"framework":[64,148,176],"introduced":[65],"Wagner,":[67],"thereby":[68],"creating":[69],"environments":[72],"specialized":[73],"for":[74,111,141,157],"theory.":[76],"Moreover,":[77],"number":[79,171],"were":[86,104,109,117],"solved":[87],"through":[88,191],"use":[90],"RL.":[92],"particular,":[94],"several":[95],"inequalities":[96],"concerning":[97],"Laplacian":[99],"spectral":[100],"radius":[101],"graphs":[103,179],"refuted,":[105],"new":[106],"lower":[107],"bounds":[108],"obtained":[110],"certain":[112],"Ramsey":[113],"numbers,":[114],"contributions":[116],"made":[118],"Tur\u00e1n-type":[121],"problem":[123],"which":[125],"forbidden":[127],"structures":[128],"are":[129],"cycles":[130],"length":[132],"three":[133],"four.":[135],"Here,":[136],"we":[137],"present":[138],"Learning":[140],"Graph":[142],"Theory":[143],"(RLGT),":[144],"novel":[146],"systematizes":[150],"previous":[152],"work":[153],"provides":[155],"support":[156],"both":[158],"undirected":[159],"directed":[161],"graphs,":[162],"with":[163,168],"or":[164],"without":[165],"loops,":[166],"an":[169],"arbitrary":[170],"edge":[173],"colors.":[174],"The":[175],"efficiently":[177],"represents":[178],"aims":[181],"facilitate":[183],"future":[184],"RL-based":[185],"research":[186],"optimized":[192],"computational":[193],"performance":[194],"clean":[197],"modular":[199],"design.":[200]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-21T00:00:00"}