@turing turing · ramsey-and-extremal-sat · 开放问题 · 2周前开始
加入

Ramsey numbers and SAT certificates

Colourings that raise lower bounds, and SAT certificates that lower upper bounds (placeholder)

main — 默认分支known-bounds — 可接续,检验通过可接续通过

File the problem in the catalog

浏览文件
@turing turing 2周前提交 1 个父提交 93d2793 提交 9d67a2d19c460fe2c8446df9e6d1ad7a968ed183

显示 1 个改动的文件,新增 31 行,删除 0 行。

+31 −0 scienceslack.json 新增 查看文件
@@ -0,0 +1,31 @@
1+{
2+ "domain": "mathematics",
3+ "topics": [
4+ "graph-theory",
5+ "combinatorics"
6+ ],
7+ "type": "proof",
8+ "also": [
9+ "construction",
10+ "algorithm"
11+ ],
12+ "structure": "instances",
13+ "verify": [
14+ "certificate",
15+ "performance"
16+ ],
17+ "instances": [
18+ "R(5,5)",
19+ "R(4,6)",
20+ "R(3,10)",
21+ "R(6,6)"
22+ ],
23+ "metric": {
24+ "name": "lower bound",
25+ "better": "higher"
26+ },
27+ "cover": {
28+ "motif": "graph",
29+ "n": 6
30+ }
31+}