Quasi-random graphs

AUTOR(ES)

Chung, F. R. K.

RESUMO

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.

Documentos Relacionados

• Quasi-random hypergraphs
• Spectra of random graphs with given expected degrees
• Discrete-time random walks on diagrams (graphs) with cycles.
• The average distances in random graphs with given expected degrees
• Interrelations between random walks on diagrams (graphs) with and without cycles.