Author:
BALL SIMEON,PEPE VALENTINA
Abstract
We show that there are graphs with n vertices containing no K5,5 which have about n7/4 edges, thus proving that ex(n, K5,5) ≥ (1 + o(1))n7/4. This bound gives an asymptotic improvement to the known lower bounds on ex(n, Kt, s) for t = 5 when 5 ≤ s ≤ 12, and t = 6 when 6 ≤ s ≤ 8.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Turán number of directed paths and oriented cycles;Graphs and Combinatorics;2023-04-08
2. The automorphism group of projective norm graphs;Applicable Algebra in Engineering, Communication and Computing;2023-01-10
3. Supersaturated Sparse Graphs and Hypergraphs;International Mathematics Research Notices;2018-03-08
4. A note on projective norm graphs;International Journal of Number Theory;2017-11-21
5. On Sets Free of Sumsets with Summands of Prescribed Size;Combinatorica;2017-02-13