Revision as of 01:32, 3 September 2020 edit Citation bot (talk \| contribs) Bots 5,870,898 edits Alter: journal, title. Add: s2cid, author pars. 1-1. Removed URL that duplicated unique identifier. Removed parameters. Some additions/deletions were actually parameter name changes. \| You can use this bot yourself. Report bugs here. \| Suggested by AManWithNoPlan \| All pages linked from cached copy of User:AManWithNoPlan/sandbox2 \| via #UCB_webform_linked ← Previous edit		Revision as of 01:45, 18 December 2020 edit undo Monkbot (talk \| contribs) Bots 3,695,952 edits m Task 18 (cosmetic): eval 8 templates: del empty params (2×); Tag: AWB Next edit →
Line 1: 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 [[Claude Berge\|Berge]]<ref name=":0">{{Cite journal\|last=Berge\|first=Claude\|date=1970\|title=Sur certains hypergraphes généralisant les graphes bipartites~~\|url=~~\|journal=Combinatorial Theory and Its Applications\|volume=1\|pages=119–133~~\|via=~~}}</ref> as a natural generalization of bipartite graphs. He provided two equivalent definitions. == Definition by 2-colorability ==

Balanced hypergraph: Difference between revisions