Concepedia

Topological cliques in graphs II

János Komlós, Endre Szemerédi

Combinatorics Probability Computing · 1996 · 156 citations · 5 references

DOI

Concepts

Abstract

This note contains a refinement of our paper [8], leading to an alternative proof of a conjecture of Mader and of Erdős and Hajnal recently proved by Bollobás and Thomason.

References

5

On sets of integers containing k elements in arithmetic progression

Endre Szemerédi · Acta Arithmetica · 1975 · 800 citations · Full text

, , +10

On the conjecture of hajós

Paul Erdős, Siemion Fajtlowicz · COMBINATORICA · 1981 · 63 citations

, , +1

Topological Cliques in Graphs

János Komlós, Endre Szemerédi · Combinatorics Probability Computing · 1994 · 45 citations

, , +8

Topological complete subgraphs in random graphs

Miklós Ajtai, János Komlós, Endre Szemerédi · Rutgers University Community Repository (Rutgers University) · 1979 · 25 citations

, , +12

Topological cliques of random graphs

B Bollobás, Paul A. Catlin · Journal of Combinatorial Theory Series B · 1981 · 23 citations

, , +13