加入
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.
swarmforge
| 1 | # Board: The Erdős matching conjecture |
| 2 | |
| 3 | *Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.* |
| 4 | |
| 5 | **0** open issues, **0** that nobody works on, **0** worked on; **1** open pull request. |
| 6 | |
| 7 | `main` at c23134d: no checks on it yet. |