An Upper Bound on Zarankiewicz' Problem
From MaRDI portal
Publication:4883060
DOI10.1017/S0963548300001814zbMath0857.05048OpenAlexW2006135590MaRDI QIDQ4883060
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
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (55)
New upper bound for multicolor Ramsey number of odd cycles ⋮ 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 ⋮ Multicolour Turán problems ⋮ A variation of a classical Turán-type extremal problem ⋮ Degenerate Turán problems for hereditary properties ⋮ A separation between tropical matrix ranks ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) ⋮ A contribution to the Zarankiewicz problem ⋮ Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\) ⋮ Random algebraic construction of extremal graphs ⋮ A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem ⋮ Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ Forbidding multiple copies of forestable graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Turán numbers of bipartite graphs plus an odd cycle ⋮ Bipartite-ness under smooth conditions ⋮ Inverting the Turán problem ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ Erdős-Szekeres theorem for multidimensional arrays ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Multicolor Ramsey numbers of bipartite graphs and large books ⋮ Turán numbers of several bipartite graphs ⋮ Spectral Turán problems for intersecting even cycles ⋮ The number of \(K_{m,m}\)-free graphs ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Bounds for generalized Sidon sets ⋮ Multicolor bipartite Ramsey number of C4 and large Kn, n ⋮ Forbidden configurations and product constructions ⋮ The spectral radius of graphs with no odd wheels ⋮ Bipartite algebraic graphs without quadrilaterals ⋮ Bipartite Ramsey numbers of \(K_{t,s}\) in many colors ⋮ Counting configuration-free sets in groups ⋮ Forbidden Berge hypergraphs ⋮ Unnamed Item ⋮ The early evolution of the \(H\)-free process ⋮ Ramsey numbers for partially-ordered sets ⋮ Compact distributed certification of planar graphs ⋮ Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\) ⋮ Size bipartite Ramsey numbers ⋮ A new upper bound for the bipartite Ramsey problem ⋮ Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle ⋮ Bipartite Ramsey numbers involving large \(K_{n,n}\) ⋮ On the Ramsey problem for multicolor bipartite graphs ⋮ Bipartite Independence Number in Graphs with Bounded Maximum Degree ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Ramsey functions involving \(K_{m,n}\) with \(n\) large ⋮ On generalized Ramsey theory: The bipartite case ⋮ A hierarchy of randomness for graphs ⋮ Norm-graphs: Variations and applications
Cites Work
This page was built for publication: An Upper Bound on Zarankiewicz' Problem
