Revision as of 00:18, 11 February 2016 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits Algorithmic aspects ← Previous edit		Revision as of 00:24, 11 February 2016 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,811 edits m →Applications and examples: math Next edit →
Line 44: \| volume = 327 \| year = 2005}}..</ref> although the reverse is not true. *The vertices of the [[Kneser graph]] {{math\|''KG''(''n'',''k'')}} are the ''{{mvar\|k''}}-subsets of an ''{{mvar\|n''}}-set, and the edges are between [[Disjoint sets\|disjoint]] sets. The complement is the [[Johnson graph]] {{math\|''J''(''n'',''k'')}}, where the edges are between intersecting sets.<ref>{{citation \| last1 = Bailey \| first1 = Robert F. \| last2 = Cáceres \| first2 = José

Complement graph: Difference between revisions