Join
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.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No closed issues
Issues hold questions, sub-problems and requests for help.