Sparse quasi-random graphs

DOI10.1007/S004930200010zbMATH Open0997.05090OpenAlexW2134981701WikidataQ105584592 ScholiaQ105584592MaRDI QIDQ1848147FDOQ1848147

Authors: Ron Graham, Fan Chung 

Publication date: 3 November 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200010

Recommendations

• Quasi-random graphs
• Quasi-random graphs
• Random Subgraphs in Sparse Graphs
• Random perturbation of sparse graphs
• scientific article; zbMATH DE number 747040
• Quasirandomness in Graphs
• Sparse graphs: metrics and random models
• Dismantling Sparse Random Graphs
• Countable sparse random graphs

zbMATH Keywords

random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (32)

• Eigenvalues and extremal degrees of graphs
• Clustering coefficients of large networks
• Quasi‐random graphs with given degree sequences
• Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
• The poset of hypergraph quasirandomness
• Random walks on quasirandom graphs
• Quasi-random graphs
• A spectral approach to analysing belief propagation for 3-colouring
• On an anti-Ramsey property of random graphs
• From quasirandom graphs to graph limits and graphlets
• Eigenvalues of Cayley graphs
• Quasi-random oriented graphs
• Graph partitioning via adaptive spectral techniques
• Regularity lemmas for clustering graphs
• Hermitian matrices and graphs: Singular values and discrepancy
• Regular pairs in sparse random graphs I
• Large holes in quasi-random graphs
• Quasirandom Cayley graphs
• Quasi-random graphs
• On the Turán number for the hexagon
• Discrepancy and eigenvalues of Cayley graphs
• Quasi-random graphs of given density and Ramsey numbers
• Powers of Hamilton cycles in pseudorandom graphs
• Extremal results in sparse pseudorandom graphs
• On a theorem of Razborov
• Forcing quasirandomness with triangles
• An analytic approach to sparse hypergraphs: hypergraph removal
• The cut metric, random graphs, and branching processes
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• Structural Properties of Sparse Graphs
• Counting results for sparse pseudorandom hypergraphs. I.
• Counting results for sparse pseudorandom hypergraphs. II.

This page was built for publication: Sparse quasi-random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848147)