New asymptotics for bipartite Turán numbers
type: Item
instance of: scholarly article
title: New asymptotics for bipartite Turán numbers
zbMATH Open document ID: 0858.05064
published in: Journal of Combinatorial Theory. Series A
publication date: 1996-07-24T00:00:00Z
review text: For a graph \(G\), \(\text{ex}(n,G)\) denotes the maximum number of edges of a graph on \(n\) vertices not containing \(G\) as a subgraph. The author provides a construction which implies that for fixed \(t>1\), and \(n\to\infty\), \(\lim\text{ex}(n,K(2,t+1))n^{-{3\over 2}}=\sqrt t/2\), where \(K(m,n)\) is a complete bipartite graph with \(m\) and \(n\) vertices in its colour classes, respectively.
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 909617
zbMATH Keywords: bipartite graph
Wikidata QID: Q29396726
author: Zoltán Füredi
reviewed by: Peter Horák
MaRDI profile type: Publication
full work available at URL: jcta.1996.0067
OpenAlex ID: W2080305978
DOI: 10.1006/JCTA.1996.0067
description: scientific article; zbMATH DE number 909617