An upper bound on Zarankiewicz' problem

Research output: Contribution to journalArticle

60 Citations (Scopus)

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 Ková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 ex(n,K3,3) ∼ 1/2 n5/3.

Original languageEnglish
Pages (from-to)29-33
Number of pages5
JournalCombinatorics Probability and Computing
Volume5
Issue number1
Publication statusPublished - 1996

Fingerprint

Upper bound
Asymptotically Optimal
Graph in graph theory
Denote

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Mathematics(all)
  • Discrete Mathematics and Combinatorics
  • Statistics and Probability
  • Theoretical Computer Science

Cite this

An upper bound on Zarankiewicz' problem. / Füredi, Z.

In: Combinatorics Probability and Computing, Vol. 5, No. 1, 1996, p. 29-33.

Research output: Contribution to journalArticle

@article{48bbca3903c64db8ad5e893f454d95c5,
title = "An upper bound on Zarankiewicz' problem",
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 Kov{\'a}ri, T. S{\'o}s and Tur{\'a}n on Zarankiewicz' problem, we obtain that Brown's example for a maximal K3,3-free graph is asymptotically optimal. Hence ex(n,K3,3) ∼ 1/2 n5/3.",
author = "Z. F{\"u}redi",
year = "1996",
language = "English",
volume = "5",
pages = "29--33",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - An upper bound on Zarankiewicz' problem

AU - Füredi, Z.

PY - 1996

Y1 - 1996

N2 - Let ex(n,K3,3) denote the maximum number of edges of a K3,3-free graph on n vertices. Improving earlier results of Ková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 ex(n,K3,3) ∼ 1/2 n5/3.

AB - Let ex(n,K3,3) denote the maximum number of edges of a K3,3-free graph on n vertices. Improving earlier results of Ková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 ex(n,K3,3) ∼ 1/2 n5/3.

UR - http://www.scopus.com/inward/record.url?scp=0030537409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030537409&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 29

EP - 33

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1

ER -