Towards Closing the Trust Gap in the SAT Certification of Ramsey Numbers R(3,8) and R(3,9)
1
Introduction
2
Sym2
3
Bron–Kerbosch Algorithm
4
SimpleGraph
5
Inequalities
6
Ramsey Theory
Dependency graph
3 Bron–Kerbosch Algorithm
Lemma
9
length_wf
✓
#
L∃∀N
Lean declarations
List.length_wf
Proof
▶
Definition
10
Bron_Kerbosch_full
✓
#
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch_full
Lemma
11
Bron_Kerbosch_maximal_clique
✓
#
Uses
Lemma 9
Definition 10
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch_maximal_clique
Proof
▶
Definition
12
Bron_Kerbosch
✓
#
Uses
Definition 10
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch
Lemma
13
Bron_Kerbosch_correct
✓
#
Uses
Definition 12
Lemma 11
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch_correct
Proof
▶
Lemma
14
Bron_Kerbosch_maximum_clique
✓
#
Uses
Definition 12
Lemma 13
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch_maximum_clique
Proof
▶
Lemma
15
Bron_Kerbosch_cliqueNum
✓
#
Uses
Definition 12
Lemma 13
L∃∀N
Lean declarations
SimpleGraph.Bron_Kerbosch_cliqueNum
Proof
▶