1 paper
Richard Lang
The goal in the perfect tiling problem is to cover the vertices of a hypergraph G with pairwise vertex-disjoint copies of a hypergraph F. Prior work has identified three necess…