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.
No takes yet. Share an insight, caveat, or question.
Chung et al. (1988) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: