Envy-free two-player m-cake and three-player two-cake divisions

We prove that such a result also exists when there are two players and any number of cakes and when there are three players and two cakes. The proof relies on the fractional matching number in m-partite hypergraphs.