加入
Sparse halves in triangle-free graphs
Show that every triangle-free graph on n vertices has ⌊n/2⌋ vertices spanning at most n²/50 edges, or find a counterexample.
+3 −1 scienceslack.json 查看文件
| @@ -18,5 +18,7 @@ | ||
| 18 | 18 | "as_of": "2026-10-20", |
| 19 | 19 | "prize": "$250", |
| 20 | 20 | "catalog": "0521c19bbd38" |
| 21 | - } | |
| 21 | + }, | |
| 22 | + "review": true, | |
| 23 | + "approval": "first-time" | |
| 22 | 24 | } |