Sparse quasi-random graphs
From MaRDI portal
Publication:1848147
DOI10.1007/s004930200010zbMath0997.05090WikidataQ105584592 ScholiaQ105584592MaRDI QIDQ1848147
Ronald L. Graham, Fan R. K. 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
05C80: Random graphs (graph-theoretic aspects)
Related Items
Regular pairs in sparse random graphs I, FORCING QUASIRANDOMNESS WITH TRIANGLES, Quasirandom Cayley graphs, An analytic approach to sparse hypergraphs: hypergraph removal, The poset of hypergraph quasirandomness, The cut metric, random graphs, and branching processes, From quasirandom graphs to graph limits and graphlets, On a theorem of Razborov, Powers of Hamilton cycles in pseudorandom graphs, Hermitian matrices and graphs: Singular values and discrepancy, Embedding graphs with bounded degree in sparse pseudorandom graphs, Regularity lemmas for clustering graphs, Clustering coefficients of large networks, Counting results for sparse pseudorandom hypergraphs. I., Counting results for sparse pseudorandom hypergraphs. II., Extremal results in sparse pseudorandom graphs, On the Turán number for the hexagon, Discrepancy and eigenvalues of Cayley graphs, On an anti-Ramsey property of random graphs, A Spectral Approach to Analysing Belief Propagation for 3-Colouring, Graph Partitioning via Adaptive Spectral Techniques