A parallelized RL search over graphs produces three new counterexamples to conjectured Laplacian spectral radius bounds, alongside a speedup claim that is only weakly supported.
A survey of automated conjectures in spectral graph theory,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Reinforcement learning for graph theory, Parallelizing Wagner's approach
A parallelized RL search over graphs produces three new counterexamples to conjectured Laplacian spectral radius bounds, alongside a speedup claim that is only weakly supported.