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