Revision as of 11:02, 4 September 2020 edit Citation bot (talk \| contribs) Bots 5,863,246 edits Add: url, issue, s2cid. Removed URL that duplicated unique identifier. \| 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 16:03, 11 September 2020 edit undo John of Reading (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 787,571 edits m Typo/general fixes, replaced: An clique → A clique, vice-versa → vice versa Tag: AWB Next edit →
Line 27: == Disjointness graph == The '''disjointness graph''' of a hypergraph ''H'', denoted D(''H''), is the graph whose vertex set is the set of the hyperedges of ''H'', with two vertices adjacent in D(''H'') when their corresponding hyperedges are ''disjoint'' in ''H''.<ref>{{Cite journal\|last=Meshulam\|first=Roy\|date=2001-01-01\|title=The Clique Complex and Hypergraph Matching\|journal=Combinatorica\|language=en\|volume=21\|issue=1\|pages=89–94\|doi=10.1007/s004930170006\|s2cid=207006642\|issn=1439-6912}}</ref> In other words, D(''H'') is the [[complement graph]] of L(''H''). AnA [[Clique (graph theory)\|clique]] in D(''H'') corresponds to an independent set in L(''H''), and vice- versa. == References == {{Reflist}} {{citation \| first = L. W. \| last = Beineke Line 39 ⟶ 40: \| publisher = Teubner \| ___location = Leipzig \| pages = 17–23 \| year = 1968}}. {{citation\|last=Berge\|first=C.\|title=Hypergraphs: Combinatorics of Finite Sets\|year=1989\|___location=Amsterdam\|publisher=North-Holland\|mr=1013569\|authorlink=Claude Berge}}. Translated from the French. *{{citation \| first1 = J. C. \| last1 = Bermond

Line graph of a hypergraph: Difference between revisions