1 problem

The r-matching sequencibility conjecture for complete uniform hypergraphs. For all $r$, $n$, and $k$,