Sparse quasi-random graphs

Combinatorica

Volumn 22, Issue 2, 2002, Pages 217-244

  Chung, Fan ^a   Graham, Ronald ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036332631     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930200010     Document Type: Article

References (28)

1. Constructive bounds for a Ramsey-type problem
2. Non-averaging subsets and non-vanishing transversals
3. Hölder type inequality for symmetric matrices with nonnegative entries
4. Diameters and eigenvalues
5. Quasi-random classes of hypergraphs
6. Quasi-random hypergraphs
7. Quasi-random tournaments
8. Maximum cuts and quasi-random graphs
9. On graphs not containing prescribed induced subgraphs
10. Quasi-random set systems
11. n
12. Quasi-random graphs
13. The regularity lemma for hypergraphs and quasi-randomness
14. Cohomological aspects of hypergraphs
15. On a problem of graph theory
16. The number of submatrices of given type in a Hadamard matrix and related results
17. An estimate for character sums
18. Inequalities in quadratic forms
19. Ramanujan graphs
20. An inequality arising in genetical theory
21. Non-Ramsey graphs are clog n-universal
22. On the universality of graphs with uniformly distributed edges
23. Szemerédi partitions and quasi-randomness
24. Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
25. Random graphs, strongly regular graphs and pseudo-random graphs
26. Pseudo-random graphs
27. Dense expanders and pseudo-random bipartite graphs