Triangulated spheres and colored cliques (Q1864189)

\textit{R. Aharoni} and \textit{P. Haxell} [J. Graph Theory 35, 83-88 (2000; Zbl 0956.05075)] proved a generalization of Hall's theorem which concerns families of sets, to families of hypergraphs. \textit{R. Meshulam} [The clique complex and hypergraph matching, Combinatorica 21(1), 89-94 (2001)] proved an extension of this result, using homology and the nerve theorem. The present paper re-proves Meshulam's result, using a more elementary approach of triangulations.