A generalization of bipartite graphs where edges can connect more than two vertices of different sets, which is also called a hypergraph or a bipartite incidence graph.
A generalization of bipartite graphs where edges can connect more than two vertices of different sets, which is also called a hypergraph or a bipartite incidence graph.