Combinatorica

, Volume 9, Issue 4, pp 345–362

Quasi-random graphs

  • F. R. K. Chung
  • R. L. Graham
  • R. M. Wilson
Article

DOI: 10.1007/BF02125347

Cite this article as:
Chung, F.R.K., Graham, R.L. & Wilson, R.M. Combinatorica (1989) 9: 345. doi:10.1007/BF02125347

Abstract

We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.

AMS subject classification (1980)

05C80 

Copyright information

© Akadémiai Kiadó 1989

Authors and Affiliations

  • F. R. K. Chung
    • 1
  • R. L. Graham
    • 2
  • R. M. Wilson
    • 3
  1. 1.Bell Communications ResearchMorristownUSA
  2. 2.AT & Bell LaboratoriesMurray HillUSA
  3. 3.California Institute of TechnologyPasadenaUSA

Personalised recommendations