Equitable Hypergraph Orientations

Yair Caro, Douglas West, Raphael Yuster

Abstract


A classical result in graph theory asserts that every graph can be oriented so that the indegree and outdegree of each vertex differ by at most $1$. We study the extent to which the result generalizes to uniform hypergraphs.


Full Text: PDF