Reinforcement Learning the Chromatic Symmetric Function
On the map: Deep reinforcement learning methods → RL for games and combinatorial optimization
Abstract (arXiv)
We propose a conjectural counting formula for the coefficients of the chromatic symmetric function of unit interval graphs using reinforcement learning. The formula counts specific disjoint cycle-tuples in the graphs, referred to as Eschers, which satisfy certain concatenation conditions. These conditions are identified by a reinforcement learning model and are independent of the particular unit interval graph, resulting a universal counting expression.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL for games and combinatorial optimization, one of 15 directions in Deep reinforcement learning methods. Builds on 1 of its 13 references that are in the map. First posted on arXiv 24 Oct 2024.
Builds on
1 of 13 references.
References · 1
- 2021Constructions in combinatorics via neural networkscited by 48
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Reinforcement learning for graph theory, Parallelizing Wagner's approach
- 2026RLGT: A reinforcement learning framework for extremal graph theory
- 2024Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective
- 2024Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
- 2024Reinforcement Learning for Graph Coloring: Understanding the Power and Limits of Non-Label Invariant Representations
- 2024Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
- 2024A Systematization of the Wagner Framework: Graph Theory Conjectures and Reinforcement Learning
- 2026Reinforcement Learning for Graph Generation under a Hard Assortativity Constraint