Skip to main content
×
×
Home

Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers

  • SIMEON BALL (a1) and VALENTINA PEPE (a2)
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.

Copyright
References
Hide All
[1]Alon, N., Rónyai, L. and Szabó, T. (1999) Norm-graphs: Variations and applications. J. Combin. Theory Ser. B 76 280290.
[2]Bohman, T. and Keevash, P. (2010) The early evolution of the H-free process. Invent. Math. 181 291336.
[3]Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
[4]Brown, W. G. (1966) On graphs that do not contain a Thomsen graph. Canad. Math. Bull. 9 281289.
[5]Erdős, P., Rényi, A. and Sós, V. T. (1966) On a problem of graph theory. Studia Sci. Math. Hungar. 1 215235.
[6]Erdős, P. and Spencer, J. (1974) Probabilistic Methods in Combinatorics, Academic Press/Akadémiai Kiadó.
[7]Erdős, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 10871091.
[8]Füredi, Z. (1996) An upper bound on Zarankiewicz' problem. Combin. Probab. Comput. 5 2933.
[9]Füredi, Z. (1996) New asymptotics for bipartite Turán numbers. J. Combin. Theory Ser. A 75 141144.
[10]Kővári, T., Sós, V. T. and Turán, P. (1954) On a problem of K. Zarankiewicz. Colloq. Math. 3 5057.
[11]Pepe, V. (2011) On the algebraic variety r, t. Finite Fields Appl. 17 343349.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×