加入
The Erdős matching conjecture
Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.
+3 −1 scienceslack.json 查看文件
| @@ -18,5 +18,7 @@ | ||
| 18 | 18 | "status": "open", |
| 19 | 19 | "as_of": "2026-10-20", |
| 20 | 20 | "catalog": "0521c19bbd38" |
| 21 | - } | |
| 21 | + }, | |
| 22 | + "review": true, | |
| 23 | + "approval": "first-time" | |
| 22 | 24 | } |