New asymptotics for bipartite Turán numbers
From MaRDI portal
Publication:1919672
DOI10.1006/jcta.1996.0067zbMath0858.05064OpenAlexW2080305978WikidataQ29396726 ScholiaQ29396726MaRDI QIDQ1919672
Publication date: 24 July 1996
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1996.0067
Related Items (72)
On finding common neighborhoods in massive graphs. ⋮ Spectral extremal graphs for intersecting cliques ⋮ On Turán exponents of bipartite graphs ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Degenerate Turán problems for hereditary properties ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ A contribution to the Zarankiewicz problem ⋮ Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\) ⋮ New results on the Zarankiewicz problem ⋮ Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs ⋮ On the Edit Distance from K2,t-Free Graphs ⋮ Small cores in 3-uniform hypergraphs ⋮ A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem ⋮ Upper and lower bounds on the size of $B_k[g$ sets] ⋮ The number of copies of \(K_{2,t+1}\) in a graph ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ Forbidding multiple copies of forestable graphs ⋮ An average degree condition for independent transversals ⋮ On the Turán number of forests ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Turán numbers of bipartite graphs plus an odd cycle ⋮ Bipartite-ness under smooth conditions ⋮ A note on 3‐partite graphs without 4‐cycles ⋮ Ramsey numbers involving large dense graphs and bipartite Turán numbers ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Spectral Turán problems for intersecting even cycles ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ Forbidden subgraphs in the norm graph ⋮ Orthonormal representations of \(H\)-free graphs ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Topological minors in bipartite graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ A counterexample to sparse removal ⋮ Graphs with no induced \(K_{2,t}\) ⋮ Induced Turán Numbers ⋮ Bipartite algebraic graphs without quadrilaterals ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Bipartite Ramsey numbers of \(K_{t,s}\) in many colors ⋮ New results for finding common neighborhoods in massive graphs in the data stream model ⋮ Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices ⋮ The de Bruijn-Erdős theorem for hypergraphs ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ Good edge-labelling of graphs ⋮ New lower bounds for Ramsey numbers of graphs and hypergraphs ⋮ Contributions to the problem of Zrankiewicz ⋮ Small sets and Markov transition densities. ⋮ A connection between coding theory and polarized partition relations ⋮ Unnamed Item ⋮ The early evolution of the \(H\)-free process ⋮ Good edge-labelling of graphs ⋮ Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\) ⋮ Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>-free bipartite graphs ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Regular Turán numbers of complete bipartite graphs ⋮ Turán Numbers of Bipartite Subdivisions ⋮ Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle ⋮ Extremal digraphs avoiding an orientation of \(C_4\) ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ A hypergraph extension of the bipartite Turán problem ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Turán numbers of theta graphs ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ Generalized Turán problems for complete bipartite graphs ⋮ On generalized Ramsey theory: The bipartite case ⋮ Norm-graphs: Variations and applications ⋮ The Game Saturation Number of a Graph ⋮ On splittable colorings of graphs and hypergraphs ⋮ Supersaturation for subgraph counts
This page was built for publication: New asymptotics for bipartite Turán numbers
