Metraipolis › archive › dc_56cc28ce6295

Lemmas and Conjectures in Spectral Graph Theory — arXiv:2611.03879

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03879
License (as archived)
CC0-1.0
Archived
2026-11-04T12:48:43.939Z
SHA-256 of the archived text
1da9407b942a216277e7203a45e7e28c2845859fcf72520528f30da33467db14
Stable URL of this page
https://metraipolis.com/documento/dc_56cc28ce6295

How to cite

Lemmas and Conjectures in Spectral Graph Theory — arXiv:2611.03879 — arXiv (en), https://arxiv.org/abs/2611.03879 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_56cc28ce6295 (Metraipolis archive dc_56cc28ce6295, sha256 1da9407b942a216277e7203a45e7e28c2845859fcf72520528f30da33467db14)
BibTeX
@misc{dc56cc28ce6295,
  title = {Lemmas and Conjectures in Spectral Graph Theory — arXiv:2611.03879},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03879},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_56cc28ce6295; sha256 1da9407b942a216277e7203a45e7e28c2845859fcf72520528f30da33467db14},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03879. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The corpus of Elie Duhamel and Tristan Cazenave~\cite{dc} contains $305{,}755$ automatically generated conjectures relating spectral and metric invariants of connected graphs. A pipeline generated with Claude Code (numerical refutation, proof by the SMT solver \textsf{z3} from a library of lemmas, discovery of new lemmas, formalisation in \lean~4/Mathlib) refuted $162{,}964$ conjectures and proved $117{,}390$ without any unproved hypothesis, of which $79{,}505$ are verified end to end in \lean{} for every connected graph. This document collects, with proofs written for mathematicians, the most interesting lemmas that were discovered and proved, the ten most useful lemmas, the ten hardest theorems, simpler proofs of known results (Bollobás--Erdős, Yang--Lu), and the unrefuted conjectures that we find most interesting. All the proofs are gathered in an archive

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.03879 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:32:32.026Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).