CaltechAUTHORS
Published February 15, 1988 | Version Published
Journal Article Open

Quasi-Random Graphs

Creators

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.

Additional Information

© 1988 by the National Academy of Sciences. Contributed by R. L. Graham, October 23, 1987. The publication costs of this article were defrayed in part by page charge payment. This article must therefore be hereby marked "advertisement" in accordance with 18 U.S.C. §1734 solely to indicate this fact.

Attached Files

Published - CHUpnas88.pdf

Files

CHUpnas88.pdf

Files (319.6 kB)

Name Size Download all
md5:3e5dd66635e7e4c4e12a40e3bce992da
319.6 kB Preview Download

Additional details

Identifiers

PMCID
PMC279681
Eprint ID
10730
Resolver ID
CaltechAUTHORS:CHUpnas88

Dates

Created
2008-06-05
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field