Revision as of 20:42, 1 July 2020 edit Erel Segal (talk \| contribs) Extended confirmed users, IP block exemptions 14,576 edits No edit summary Tag: Visual edit ← Previous edit		Revision as of 20:46, 1 July 2020 edit undo Erel Segal (talk \| contribs) Extended confirmed users, IP block exemptions 14,576 edits No edit summary Tag: Visual edit Next edit →
Line 26: == Comparison with other notions of bipartiteness == Besides balance, there are alternative generalizations of bipartite graphs. A hypergraph is called '''bipartite''' if its vertex set ''V'' can be partitioned into two sets, ''X'' and ''Y'', such that each hyperedge contains '''''exactly one''''' element of ''X'' (see [[bipartite hypergraph]]). Obviously every bipartite graph is 2-colorable. The properties of bipartiteness and balance do not imply each other.

Balanced hypergraph: Difference between revisions