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].
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics