Topological cliques in graphs II

Combinatorics Probability and Computing

Volumn 5, Issue 1, 1996, Pages 79-90

  Komlós, János ^a   Szemerédi, Endre ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030547416     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830000184X     Document Type: Article

References (11)

1. Ajtai, M., Komlós, J. and Szemerédi, E. (1979) Topological complete subgraphs in random graphs. Studia. Sci. Math. Hung. 14 293-297.
2. Alon, N. and Seymour, P. (1994) Private communication (see [8]).
3. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
4. Bollobás, B. and Catlin, P. (1981) Topological cliques of random graphs. J. Combinatorial Theory (B) 30 224-227.
5. Bollobás, B. and Thomason, A. Topological complete subgraphs. (Manuscript.)
6. Erdos, P. and Fajtlowicz, S. (1981) On the conjecture of Hajós. Combinatorica 1 141-143.
7. Erdos, P. and Hajnal, A. (1969) On complete topological subgraphs of certain graphs. Ann. Univ. Sci. Budapest 1 193-199.
8. Komlós, J. and Szemerédi, E. (1994) Topological cliques in graphs. Combinatorics, Probability & Computing 3 247-256.
9. Mader, W. (1967) Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174 265-268.
10. Mader, W. (1972) Hinreichende Bedingungen fur die Existenz von Teilgraphen die zu einem vollstandigen Graphen homöomorph sind. Math. Nachr. 53 145-150.
11. Szemerédi, E. (1976) Regular partitions of graphs. Colloques Internationaux CNRS No. 260 - Problèmes Combinatoires et Thèorie des Graphes Orsay, France, 399-401.