The Multiple-orientability Thresholds for Random Hypergraphs

Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou

A $k$-uniform hypergraph $H=(V,E)$ is called $\ell$-orientable, if there is an assignment of each edge $e\in E$ to one of its vertices $v\in e$ such that no vertex is assigned m…