New asymptotics for bipartite Turán numbers
From MaRDI portal
DOI10.1006/JCTA.1996.0067zbMATH Open0858.05064OpenAlexW2080305978WikidataQ29396726 ScholiaQ29396726MaRDI QIDQ1919672FDOQ1919672
Authors: Zoltán Füredi 
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
Recommendations
Cited In (82)
- New results for finding common neighborhoods in massive graphs in the data stream model
- Supersaturation for subgraph counts
- The de Bruijn-Erdős theorem for hypergraphs
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Good edge-labelling of graphs
- On Turán exponents of bipartite graphs
- Upper and lower bounds on the size of \(B_k[g]\) sets
- On the edit distance from \(K_{2,t}\)-free graphs
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Turán numbers of bipartite subdivisions
- Spectral extremal graphs for intersecting cliques
- The spectral radius of graphs with no intersecting odd cycles
- Turán numbers of theta graphs
- Exact bipartite Turán numbers of large even cycles
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Forbidding multiple copies of forestable graphs
- On finding common neighborhoods in massive graphs.
- New results on the Zarankiewicz problem
- Bipartite algebraic graphs without quadrilaterals
- Degenerate Turán problems for hereditary properties
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- Regular Turán numbers of complete bipartite graphs
- On a conjecture of Erdős and Simonovits: even cycles
- On the Turán number of forests
- Turán numbers of bipartite graphs plus an odd cycle
- The number of \(C_{2\ell}\)-free graphs
- Extremal digraphs avoiding an orientation of \(C_4\)
- Edges not in any monochromatic copy of a fixed graph
- Induced Turán numbers
- Turán number of an induced complete bipartite graph plus an odd cycle
- Turán number of bipartite graphs with no \(K_{t,t}\)
- The number of copies of \(K_{2,t+1}\) in a graph
- A contribution to the Zarankiewicz problem
- Generalized Turán problems for complete bipartite graphs
- Generalized Turán problems for disjoint copies of graphs
- Ramsey numbers involving large dense graphs and bipartite Turán numbers
- Multicolor Ramsey numbers for complete bipartite versus complete graphs
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Norm-graphs: Variations and applications
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- A counterexample to sparse removal
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Unified approach to the generalized Turán problem and supersaturation
- The bipartite Turán number and spectral extremum for linear forests
- The early evolution of the \(H\)-free process
- Small sets and Markov transition densities.
- On splittable colorings of graphs and hypergraphs
- Forbidden subgraphs in the norm graph
- Small cores in 3-uniform hypergraphs
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- On generalized Ramsey theory: The bipartite case
- Topological minors in bipartite graphs
- A hypergraph extension of the bipartite Turán problem
- The Game Saturation Number of a Graph
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Contributions to the problem of Zrankiewicz
- Infinite Turán problems for bipartite graphs
- General lemmas for Berge-Turán hypergraph problems
- Orthonormal representations of \(H\)-free graphs
- Asymptotics for the Turán number of Berge-\(K_{2,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
- Good edge-labelling of graphs
- Many \(T\) copies in \(H\)-free graphs
- Bipartite Ramsey numbers of \(K_{t,s}\) in many colors
- Improved upper bounds on even-cycle creating Hamilton paths
- Multi-color Ramsey numbers of two bipartite graphs
- Graphs with no induced \(K_{2,t}\)
- A note on 3‐partite graphs without 4‐cycles
- A connection between coding theory and polarized partition relations
- A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem
- Two multicolor Ramsey numbers involving bipartite graphs
- New bounds for a hypergraph bipartite Turán problem
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Spectral Turán problems for intersecting even cycles
- Generalized Turán problems for \(K_{2,t}\)
- Forbidding \(K_{2,t}\) traces in triple systems
- An average degree condition for independent transversals
- Bipartite-ness under smooth conditions
- On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
- Induced Turán problem in bipartite graphs
- Minimal abundant packings and choosability with separation
This page was built for publication: New asymptotics for bipartite Turán numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919672)
