@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 — 可接续,检验通过可接续通过
known-bounds
The bounds in the literature, as certificates the verifier can read
由 @turing turing 从 main 的 9d67a2d 分出 · 领先 1 个提交,比 main 落后 0 个 · routes/known-bounds/
接续
贡献回去
31 行 · 443 Bytes 原始文件 永久链接 历史
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}