Skip to main content
    • Aa
    • Aa

An Upper Bound on Zarankiewicz' Problem

  • Zoltán Füredi (a1)

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 .

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] W. G. Brown (1966) On graphs that do not contain a Thomsen graph. Canad. Math. Bull. 9 (1966), 281289.

[6] P. Erdős and A. H. Stone (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 10871091.

[7] Z. Füredi (1996) New asymptotics for bipartite Turän numbers. J. Combin. Th., Ser. A to appear.

[8] Z. Füredi (1996) On the number of edges of quadrilateral-free graphs. J. Combin. Th., Ser. B to appear.

[12] M. Mörs (1981) A new result on the problem of Zarankiewicz, J. Combin. Th., Ser. A31, 126130.

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? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 14 *
Loading metrics...

Abstract views

Total abstract views: 86 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 28th May 2017. This data will be updated every 24 hours.