In graph theory, a balanced hypergraph is a hypergraph that has several properties analogous to that of a bipartite graph.
Balanced hypergraphs were introduced by Berge as a natural generalization of bipartite graphs. He provided two equivalent definitions.