Uniquely C4-Saturated Graphs

For a fixed graph H, a graph G is uniquely H-saturated if G does not contain H, but the addition of any edge from $${\overline{G}}$$ to G completes exactly one copy of H. Using a combination of algebraic methods and counting arguments, we determine all the uniquely C4-saturated graphs; there are only ten of them.

[1]  J. Q. Longyear,et al.  The friendship theorem , 1972 .

[2]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[3]  Oleg Pikhurko.  Results and Open Problems on Minimum Saturated Hypergraphs , 2004, Ars Comb..

[4]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[5]  Craig Huneke.  The Friendship Theorem , 2002, Am. Math. Mon..

[6]  Paul Erdös,et al.  On a Problem in Graph Theory , 1963, The Mathematical Gazette.