Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs

Tantan Dai, Alexander Divoux, Tom Kelly

A hypergraph is \textit{bipartite with bipartition $(A,B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturate…