On self-complementation

We prove that, with very few exceptions, every graph of order n, n ? 0, 1(mod 4) and size at most n ? 1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs.