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.
Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.