A generalization of hall's theorem for k-uniform k-partite hypergraphs

TL;DR

This paper extends Hall's theorem to k-uniform k-partite hypergraphs, providing necessary and sufficient conditions for the existence of large matchings under specific structural assumptions.

Contribution

It introduces a generalized version of Hall's theorem for hypergraphs with a unique perfect matching in a subhypergraph, offering new theoretical insights.

Findings

Established a necessary and sufficient condition for matchings of size |V1|

Provided counterexamples illustrating the limits of the theorem

Connected the generalized theorem to existing hypergraph matching results

Abstract

In this paper we prove a generalized version of Hall's theorem for hypergraphs. More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1, V2,..., Vk-1 has a unique perfect matching. In this case, we give a necessary and sufficient condition for having a matching of size t = |V1| in H. Some relevant results and counterexamples are given as well.