Almost all graphs with 2.522 n edges are not 3-colorable

Dimitris Achlioptas, Michael Molloy. Almost all graphs with 2.522 n edges are not 3-colorable. Electr. J. Comb., 6, 1999. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.