Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs

Combinatorica

Volumn 17, Issue 4, 1997, Pages 577-596

  Simonovits, MiklóS ^a   Sós, Vera T ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039464497     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01195005     Document Type: Article

References (19)

1. B. BOLLOBÁS: Random, Graphs, Academic Press, 1985.
2. F. R. K. CHUNG, R. L. GRAHAM and R. M. WILSON: Quasi-random graphs, Combinatorica, 9 (4), (1989), 345-362.
3. F. R. K. CHUNG, R. and R. L. GRAHAM: Quasi-random hypergraphs, Random Structures and Algorithms, 1 (1990), 105-124.
4. F. R. K. CHUNG: Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms, Vol. 2 (2) (1991), 241-252.
5. F. R. K. CHUNG and R. L. GRAHAM: Quasi-random set systems, Journal of the American Math. Society, 4 (1) January, (1991), 151-196.
6. F. R. K. CHUNG and R. L. GRAHAM: Maximum cuts and quasi-random graphs, in Random Graphs, (Poznan Conf, 1989) Wiley-Intersci, Publ. vol 2, 23-33.
7. F. R. K. CHUNG and R. L. GRAHAM: On hypergraphs having evenly distributed subhypergraphs, (in the Proc. Conf. Marseille-Luminy, 1990) Discrete Mathematics, 111 (1-3) (1993), 125-129.
8. M. DYER and A. FRIEZE: Computing the volume of convex bodies: a case where randomness provably helps, in Probabilistic Combinatorics and Its Applications (ed. Béla Bollobás), Proceedings of Symposia in Applied Mathematics, Vol. 44 (1992), 123-170.
9. P. FRANKL, V. RÖDL AND R. M. WILSON: The number of submatrices of given type in an Hadamard matrix and related results, Journal of Combinatorial Theory, (B) 44 (3) (1988), 317-328.
10. A.N. KOLMOGOROV : Three approaches to the quantitative definition of information, Problems Inform. Transmition, 1 (1965), 1-7.
11. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: Blow-up Lemma, Combinatorica, 17 (1) (1997), 109-123.
12. J. KOMLÓS and M. SIMONOVITS: Szemerédi Regularity lemma and its applications in Extremal Graph Theory, in: Paul Erdös is 80, II. Bolyai J. Math. Soc. 2, (1996), 295-352.
13. M. SIMONOVITS and V. T. SÓS: Szemerédi's Partition and quasi-randomness, Random Structures and Algorithms, 2 (1991), 1-10.
14. M. SIMONOVITS and V. T. SÓS: Hereditarily extended properties, quasi-random graphs and induced subgraphs, manuscript.
15. E. SZEMERÉDI: On regular partitions of graphs, Problemes Combinatoires et Théorie des Graphes (ed. J. Bermond et al.), CNRS Paris, 1978, 399-401.
16. E. SZEMERÉDI: On graphs containing no complete subgraphs with 4 vertices (in Hungarian) Mat. Lapok 23 (1972), 111-116.
17. A. THOMASON: Random graphs, strongly regular graphs and pseudo-random graphs, in: Surveys in Combinatorics, 1987 (Whitehead, ed.) LMS Lecture Notes Series 123, Cambridge Univ. Press, Cambridge, 1987, 173-196.
18. A. THOMASON: Pseudo-random graphs, in: Proceedings of Random graphs, Poznan, 1985, (M. Karonski, ed.); Annals of Discrete Math., 33 (1987), 307-331.
19. A. THOMASON: A disproof of a theorem of Erdös in Ramsey theory, J. London Math. Soc, 39 (2) (1989), 246-255.