The asymptotic induced matching number of hypergraphs: balanced binary strings

Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam

We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even…