### Abstract

Let f(t) be the largest integer such that every graph with average degree t has a topological clique with f(i) vertices. It is widely believed that [formula omitted]. Here we prove the weaker estimate [formula omitted].

Original language | English |
---|---|

Pages (from-to) | 247-256 |

Number of pages | 10 |

Journal | Combinatorics, Probability and Computing |

Volume | 3 |

Issue number | 2 |

DOIs | |

Publication status | Published - Jun 1994 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Topological Cliques in Graphs'. Together they form a unique fingerprint.

## Cite this

Komlós, J., & Szemerédi, E. (1994). Topological Cliques in Graphs.

*Combinatorics, Probability and Computing*,*3*(2), 247-256. https://doi.org/10.1017/S0963548300001140