Revision as of 02:17, 10 March 2009 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,802 edits source paley self-complementarity to sachs and templatize ← Previous edit		Revision as of 02:22, 10 March 2009 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,802 edits Rado graph Next edit →
Line 13: \| year = 1962}}.</ref> Since ''n''(''n'' −1) must be divisible by 4, ''n'' must be [[Congruence relation\|congruent]] to 0 or 1 mod 4; for instance, a 6-vertex graph cannot be self-complementary. Every [[Paley graph]] is self-complementary.<ref name="sachs"/> The [[Rado graph]] is an infinite self-complementary graph. ==References==

Self-complementary graph: Difference between revisions