Author:
komlós János,Szemerédi Endre
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 . Here we prove the weaker estimate .
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference11 articles.
1. [6] Komlós J. and Sós V. (manuscript) Regular subgraphs of graphs.
2. Topological cliques of random graphs
3. On complete topological subgraphs of certain graphs;Erdős;Annales Univ. Sci. Budapest,1969
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transversals in Latin Squares;Surveys in Combinatorics 2024;2024-06-13
2. Sublinear Expanders and Their Applications;Surveys in Combinatorics 2024;2024-06-13
3. Separating path systems of almost linear size;Transactions of the American Mathematical Society;2024-06-11
4. Towards the Erdős-Gallai cycle decomposition conjecture;Advances in Mathematics;2024-02
5. Rainbow clique subdivisions;European Journal of Combinatorics;2024-02