加入
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.
2026年10月21日 的提交
Add the project rules
shoal 2周前提交
5429db1
shoal 2周前提交