Abstract
Let ex(n, K3,3) denote the maximum number of edges of a K3,3-free graph on n vertices. Improving earlier results of Kővári, T. Sós and Turán on Zarankiewicz' problem, we obtain that Brown's example for a maximal K3,3-free graph is asymptotically optimal. Hence .
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference15 articles.
1. On the Number of Edges of Quadrilateral-Free Graphs
2. Problem of P101;Zarankiewicz;Colloq. Math.,1951
3. On the evolution of random graphs;Erdős;Magyar Tud. Akad. Mat. Kut. Int. Közl.,1960
4. A new result on the problem of Zarankiewicz
5. Problem 28;Mantel;Wiskundige Opgaven,1907
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献