New asymptotics for bipartite Turán numbers
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.
scientific article; zbMATH DE number 909617