Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers-Reference-Cited by-同舟云学术

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

Published:2011-10-03 Issue:3 Volume:21 Page:323-329
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

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

Reference11 articles.

1. On Graphs that do not Contain a Thomsen Graph

2. The early evolution of the H-free process

3. An Upper Bound on Zarankiewicz' Problem

4. On the structure of linear graphs

5. New Asymptotics for Bipartite Turán Numbers

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension;Combinatorica;2024-05-14

2. The Turán number of directed paths and oriented cycles;Graphs and Combinatorics;2023-04-08

3. The automorphism group of projective norm graphs;Applicable Algebra in Engineering, Communication and Computing;2023-01-10

4. Supersaturated Sparse Graphs and Hypergraphs;International Mathematics Research Notices;2018-03-08

5. A note on projective norm graphs;International Journal of Number Theory;2017-11-21