Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
arXiv:2207.03343
Abstract
We demonstrate how Monte Carlo Search (MCS) algorithms, namely Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA), can be used to build graphs and find counter-examples to spectral graph theory conjectures in minutes.
11 pages, figures and pseudocode in appendix