Imagen de Portada

RLGT: A reinforcement learning framework for extremal graph theory

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Damnjanović, Ivan, Milivojević, Uroš, Đorđević, Irena, Stevanović, Dragan
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Combinatorics 68T05, 68T07, 05C35
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Greedy trees have minimum Sombor indices
por: Damnjanović, Ivan, et al.
Publicado: (2022)

Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach
por: Ghebleh, Mohammad, et al.
Publicado: (2024)

Reinforcement learning for graph theory, II. Small Ramsey numbers
por: Ghebleh, Mohammad, et al.
Publicado: (2024)

An inverse result for Wang's theorem on extremal trees
por: Damnjanović, Ivan, et al.
Publicado: (2022)

An efficient algorithm for generating transmission irregular trees
por: Stošić, Ivan, et al.
Publicado: (2025)

Reinforcement Learning the Chromatic Symmetric Function
por: Bérczi, Gergely, et al.
Publicado: (2024)

The maximum number of connected sets in regular graphs
por: Cambie, Stijn, et al.
Publicado: (2023)

A Note on Small Percolating Sets on Hypercubes via Generative AI
por: Bérczi, Gergely, et al.
Publicado: (2024)

PatternBoost: Constructions in Mathematics with a Little Help from AI
por: Charton, François, et al.
Publicado: (2024)

Computational methods for finding bi-regular cages
por: Goedgebeur, Jan, et al.
Publicado: (2024)

Regular $K_3$-irregular graphs
por: Hak, Artem, et al.
Publicado: (2025)

Searching for regular, triangle-distinct graphs
por: Stevanović, Dragan, et al.
Publicado: (2024)

The Boundaries of Verifiable Accuracy, Robustness, and Generalisation in Deep Learning
por: Bastounis, Alexander, et al.
Publicado: (2023)

On the maximum spectral radius of connected graphs with a prescribed order and size
por: Damnjanović, Ivan
Publicado: (2025)

Piecewise linear functions and neural network expressivity via discriminantal arrangements
por: Das, Pragnya
Publicado: (2026)

On the nullities of quartic circulant graphs and their extremal null spaces
por: Damnjanović, Ivan
Publicado: (2022)

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
por: Logsdon, Sara, et al.
Publicado: (2024)

Spectral properties of balanced trees and dendrimers
por: Damnjanović, Ivan, et al.
Publicado: (2022)

Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12
por: Csikvári, Péter, et al.
Publicado: (2025)

VC-dimension of subsets of Hamming graphs
por: Housholder, Christopher, et al.
Publicado: (2025)

Water transport on finite graphs
por: Vilkas, Timo
Publicado: (2025)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
por: Bartha, Zsolt, et al.
Publicado: (2025)

Improved Bounds for Multicovering Hypergraphs
por: Babu, Anand, et al.
Publicado: (2022)

Theoretical results for Perfect Location signed Roman domination problem
por: Nikolić, Bojan, et al.
Publicado: (2025)

Uniquely $C_{4}^{+}$-saturated graphs
por: Li, Yuying, et al.
Publicado: (2024)

On the Complexity of Bipartite Degree Realizability
por: Miklós, István
Publicado: (2025)

Reconfiguration of Independent Transversals
por: Buys, Pjotr, et al.
Publicado: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
por: Goedgebeur, Jan, et al.
Publicado: (2024)

Agent-Centric Personalized Multiple Clustering with Multi-Modal LLMs
por: Chen, Ziye, et al.
Publicado: (2025)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025)

Differentiable Neural Networks with RePU Activation: with Applications to Score Estimation and Isotonic Regression
por: Shen, Guohao, et al.
Publicado: (2023)

A semicontinuous relaxation of Saito's criterion and freeness as angular minimization
por: Silva, Tomás S. R.
Publicado: (2026)

4-cop-win graphs have at least 19 vertices
por: Turcotte, Jérémie, et al.
Publicado: (2020)

Degree Realization by Bipartite Multigraphs
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols
por: Reitich, Fernando
Publicado: (2026)

Sorting inversion sequences
por: Mansour, Toufik, et al.
Publicado: (2024)

When do the Kahn-Kalai Bounds Provide Nontrivial Information?
por: Christopherson, Bryce Alan, et al.
Publicado: (2024)

Dirac's theorem and the switch geometry of perfect matchings
por: Kang, Ross J., et al.
Publicado: (2026)

An introduction to equitable DP coloring of graphs
por: Kierstead, H. A., et al.
Publicado: (2026)

The random $k$-SAT Gibbs uniqueness threshold revisited
por: Chatterjee, Arnab, et al.
Publicado: (2025)