An Upper Bound on Zarankiewicz' Problem
From MaRDI portal
Publication:4883060
DOI10.1017/S0963548300001814zbMATH Open0857.05048OpenAlexW2006135590MaRDI QIDQ4883060FDOQ4883060
Authors: Zoltán Füredi 
Publication date: 1 July 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001814
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
Cited In (63)
- The spectral radius of graphs with no odd wheels
- Bipartite Ramsey numbers of \(K_{t,s}\) in many colors
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- A hierarchy of randomness for graphs
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- On Turán exponents of bipartite graphs
- Random algebraic construction of extremal graphs
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- New bounds on even cycle creating Hamiltonian paths using expander graphs
- Spectral extremal graphs for intersecting cliques
- The spectral radius of graphs with no intersecting odd cycles
- Title not available (Why is that?)
- A new upper bound for the bipartite Ramsey problem
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- A variation of a classical Turán-type extremal problem
- Forbidding multiple copies of forestable graphs
- New upper bound for multicolor Ramsey number of odd cycles
- Bipartite algebraic graphs without quadrilaterals
- Degenerate Turán problems for hereditary properties
- A linear hypergraph extension of the bipartite Turán problem
- Turán numbers of bipartite graphs plus an odd cycle
- Rainbow generalizations of Ramsey theory: A survey
- Bipartite independence number in graphs with bounded maximum degree
- A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem
- Inverting the Turán problem
- Turán number of an induced complete bipartite graph plus an odd cycle
- The number of \(K_{m,m}\)-free graphs
- A contribution to the Zarankiewicz problem
- Generalized Turán problems for complete bipartite graphs
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- Size bipartite Ramsey numbers
- Compact distributed certification of planar graphs
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Norm-graphs: Variations and applications
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- The bipartite Turán number and spectral extremum for linear forests
- Bipartite Ramsey numbers involving large \(K_{n,n}\)
- The early evolution of the \(H\)-free process
- Bounds for generalized Sidon sets
- On generalized Ramsey theory: The bipartite case
- Forbidden configurations and product constructions
- Multicolour Turán problems
- Multicolor bipartite Ramsey number of \(C_{4}\) and large \(K_{n, n}\)
- Counting configuration-free sets in groups
- Multicolor Ramsey numbers of bipartite graphs and large books
- On the Ramsey problem for multicolor bipartite graphs
- Title not available (Why is that?)
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
- Ramsey numbers for partially-ordered sets
- Forbidden Berge hypergraphs
- Ramsey functions involving \(K_{m,n}\) with \(n\) large
- A separation between tropical matrix ranks
- Erdős-Szekeres theorem for multidimensional arrays
- Multi-color Ramsey numbers of two bipartite graphs
- The spectral even cycle problem
- Extremal graphs without exponentially small bicliques
- The high order spectral extremal results for graphs and their applications
- Turán numbers of several bipartite graphs
- Spectral Turán problems for intersecting even cycles
- Bipartite-ness under smooth conditions
- Upper bounds on the multicolor Ramsey numbers \(r_k (C_4)\)
This page was built for publication: An Upper Bound on Zarankiewicz' Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883060)
