加入
Explicit Ramsey graphs
Construct explicit graphs on n vertices with no clique or independent set of size c·log n, matching Erdős's random graphs.
+3 −1 scienceslack.json 查看文件
| @@ -20,5 +20,7 @@ | ||
| 20 | 20 | "as_of": "2026-10-20", |
| 21 | 21 | "prize": "$100", |
| 22 | 22 | "catalog": "0521c19bbd38" |
| 23 | - } | |
| 23 | + }, | |
| 24 | + "review": true, | |
| 25 | + "approval": "first-time" | |
| 24 | 26 | } |