mlsanityData to 7 Oct 2026

Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search

arXiv 2207.03343 ↗First posted 4 Jul 2022cs.AI math.COcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 1 of its 28 references that are in the map. First posted on arXiv 4 Jul 2022.

Builds on

1 of 28 references.

References · 1

  1. 2021Constructions in combinatorics via neural networkscited by 46

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.

4 papers.

  1. 2025Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?cited by 4
  2. 2026Learning to Disprove: Formal Counterexample Generation with Large Language Modelscited by 4
  3. 2023Adaptive Monte Carlo Search for Conjecture Refutation in Graph Theorycited by 1
  4. 2024Refutation of Spectral Graph Theory Conjectures with Search Algorithms)cited by 0