Author:
Bucić Matija,Draganić Nemanja,Sudakov Benny
Abstract
AbstractThe Turán number ex(n, H) of a graph H is the maximal number of edges in an H-free graph on n vertices. In 1983, Chung and Erdős asked which graphs H with e edges minimise ex(n, H). They resolved this question asymptotically for most of the range of e and asked to complete the picture. In this paper, we answer their question by resolving all remaining cases. Our result translates directly to the setting of universality, a well-studied notion of finding graphs which contain every graph belonging to a certain family. In this setting, we extend previous work done by Babai, Chung, Erdős, Graham and Spencer, and by Alon and Asodi.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference27 articles.
1. [5] Babai, L. , Chung, F. R. K. , Erdős, P. , Graham, R. L. and Spencer, J. H. (1982) On graphs which contain all sparse graphs. In Theory and Practice of Combinatorics, Vol. 60 of North-Holland Mathematics Studies, pp. 21–26.
2. On universal graphs;Chung;Ann. New York Acad. Sci.,1979
3. Spanning trees in random graphs;Montgomery;Adv. Math.,2019
4. [3] Alon, N. and Capalbo, M. (2008) Optimal universal graphs with deterministic embedding. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, pp. 373–378.
5. On unavoidable hypergraphs;Chung;J. Graph Theory,1987
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unavoidable hypergraphs;Journal of Combinatorial Theory, Series B;2021-11
2. Unavoidable Hypergraphs;Trends in Mathematics;2021