On a problem of K. Zarankiewicz
From MaRDI portal
Publication:5825672
DOI10.4064/cm-3-1-50-57zbMath0055.00704OpenAlexW1444168583MaRDI QIDQ5825672
Vera T. Sós, Pál Turán, Thomas Kövari
Publication date: 1954
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-3-1-50-57
Related Items
On the Zarankiewicz problem for intersection hypergraphs, New upper bound for multicolor Ramsey number of odd cycles, Bounds on certain multiplications of affine combinations, Many-face complexity in incremental convex arrangements, Almost all permutation matrices have bounded saturation functions, On resilient graph spanners, The number of \(C_{2\ell}\)-free graphs, New bounds for the acyclic chromatic index, Degenerate Turán problems for hereditary properties, On ordered Ramsey numbers of bounded-degree graphs, Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\), A contribution to the Zarankiewicz problem, On the OBDD representation of some graph classes, Large unavoidable subtournaments, Short proofs of some extremal results. II., Succinct posets, A crossing lemma for Jordan curves, Extremal results for random discrete structures, Vapnik-Chervonenkis density in some theories without the independence property. II, Stability results for graphs with a critical edge, An improved bound on the number of unit area triangles, Erased arrangements of linear and convex decompositions of polyhedra, A note on powers of Hamilton cycles in generalized claw-free graphs, Color the cycles, Some extremal results on complete degenerate hypergraphs, On the union complexity of diametral disks, On the Turán number of forests, On another Boolean matrix, Turán numbers of bipartite graphs plus an odd cycle, Extremal edge polytopes, On the local approach to Sidorenko's conjecture, Degrees of nonlinearity in forbidden 0-1 matrix problems, Hamiltonian cycles with all small even chords, The extremal function for partial bipartite tilings, The fine structure of octahedron-free graphs, Forbidden subgraphs in the norm graph, Symmetric sums of squares over \(k\)-subset hypercubes, A new result on the problem of Zarankiewicz, Combinatorial complexity bounds for arrangements of curves and spheres, An incidence theorem in higher dimensions, On the combinatorial problems which I would most like to see solved, The homomorphism domination exponent, A counterexample to sparse removal, Neighborhood conditions and edge-disjoint perfect matchings, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Forbidden configurations and product constructions, Lower bounds for independence numbers of some locally sparse graphs, Biclique-colouring verification complexity and biclique-colouring power graphs, Unavoidable subgraphs of colored graphs, Problems and results in extremal combinatorics. II, Edge-colorings avoiding rainbow and monochromatic subgraphs, Bipartite algebraic graphs without quadrilaterals, Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations, On edges not in monochromatic copies of a fixed bipartite graph, Short lists with short programs in short time, A separation theorem in property testing, Cycle lengths in sparse graphs, Davenport-Schinzel theory of matrices, On 3-uniform hypergraphs without a cycle of a given length, Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs, A neighborhood condition which implies the existence of a complete multipartite subgraph, Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices, Forbidden Berge hypergraphs, A tournament approach to pattern avoiding matrices, Note on robust critical graphs with large odd girth, The de Bruijn-Erdős theorem for hypergraphs, On embedding of graphs into Euclidean spaces of small dimension, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, New lower bounds for Ramsey numbers of graphs and hypergraphs, Extremal Betti numbers of Vietoris-Rips complexes, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, A problem of Zarankiewicz, On complete subgraphs of \(r\)-chromatic graphs, A randomized embedding algorithm for trees, Erdős-Hajnal-type theorems in hypergraphs, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Forbidden subposet problems for traces of set families, Combinatorial problems on the existence of large submatrices. I, More distinct distances under local conditions, Finding bipartite subgraphs efficiently, Extremal \(G\)-free induced subgraphs of Kneser graphs, On graphs which contain all small trees, An improved error term for minimum \(H\)-decompositions of graphs, Diameter graphs in \({\mathbb R}^4\), On an extremal hypergraph problem related to combinatorial batch codes, A Szemerédi-Trotter type theorem in \(\mathbb R^4\), Pseudo-random hypergraphs, Perfect error-correcting databases, Variations on the theme of repeated distances, Bipartite Ramsey numbers involving large \(K_{n,n}\), Toward better depth lower bounds: two results on the multiplexor relation, Extremal problems on triangle areas in two and three dimensions, Stability of the path-path Ramsey number, Spectral extrema of graphs: forbidden hexagon, Induced subgraphs of given sizes, Popular distances in 3-space, On a class of degenerate extremal graph problems, Norm-graphs: Variations and applications, On the use of senders in generalized Ramsey theory for graphs, A note on the complexity of finding regular subgraphs, Structured Codes of Graphs, Colouring graphs with forbidden bipartite subgraphs, Many Turán exponents via subdivisions, Turán-type results for intersection graphs of boxes, On Turán exponents of bipartite graphs, Drawing Shortest Paths in Geodetic Graphs, Convex polygons made from few lines and convex decompositions of polyhedra, Harary polynomials, Sparse Rademacher chaos in symmetric spaces, Crux and Long Cycles in Graphs, Turán theorems for unavoidable patterns, On the Extremal Number of Subdivisions, A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem, Some remarks on the Zarankiewicz problem, An extremal graph problem, Generalized Turán problems for double stars, Testing linear inequalities of subgraph statistics, Nearly \(k\)-distance sets, Unavoidable chromatic patterns in 2‐colorings of the complete graph, Extremal graphs for odd wheels, Ramsey numbers of the quadrilateral versus books, Lower bounds on the Erdős–Gyárfás problem via color energy graphs, Uniform chain decompositions and applications, Clique minors in graphs with a forbidden subgraph, Balanced supersaturation for some degenerate hypergraphs, Exact bipartite Turán numbers of large even cycles, MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS, Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls, Bipartite-ness under smooth conditions, A bipartite version of the Erdős–McKay conjecture, Off-diagonal book Ramsey numbers, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, Minimum degree and the graph removal lemma, Upper bounds on the extremal number of the 4‐cycle, A note on projective norm graphs, On some Multicolor Ramsey Properties of Random Graphs, Graphs with few paths of prescribed length between any two vertices, Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡}, Unnamed Item, Random multilinear maps and the Erd\H{o}s box problem, Multicolor Ramsey numbers of bipartite graphs and large books, From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More, The balancing number and generalized balancing number of some graph classes, A Bound on the Number of Edges in Graphs Without an Even Cycle, Large Unavoidable Subtournaments, Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, Applying the Kövári-Sós-Turán theorem to a question in group theory, Extremal Results for Berge Hypergraphs, The Zero Forcing Number of Graphs, Triangles in graphs without bipartite suspensions, Unnamed Item, Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, Color Isomorphic Even Cycles and a Related Ramsey Problem, Counting configuration-free sets in groups, Many \(T\) copies in \(H\)-free graphs, String graphs and incomparability graphs, ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A Conjecture of Verstraëte on Vertex-Disjoint Cycles, Covering and tiling hypergraphs with tight cycles, Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs, Zarankiewicz’s problem for semilinear hypergraphs, Model-theoretic Elekes–Szabó in the strongly minimal case, Ramsey numbers of ordered graphs, Counting configuration-free sets in groups, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems, Constructive lower bounds for off-diagonal Ramsey numbers, Hypergraph Ramsey numbers, The penultimate rate of growth for graph properties, A connection between coding theory and polarized partition relations, Unnamed Item, A lower bound for families of Natarajan dimension \(d\), Ramsey numbers for tournaments, Crossing patterns of segments, Vapnik-Chervonenkis density in some theories without the independence property, I, Measures on monotone properties of graphs, On the Turán number of ordered forests, Some extremal problems in geometry, Some extremal problems in geometry, On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\), Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\), Many \(T\) copies in \(H\)-free graphs, Anticoncentration for subgraph statistics, Turán Numbers of Bipartite Subdivisions, A Dichotomy Theorem for First-Fit Chain Partitions, Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle, The Price of Stability of Simple Symmetric Fractional Hedonic Games, On Grids in Point-Line Arrangements in the Plane, Dense Induced Subgraphs of Dense Bipartite Graphs, Representation Complexities of SemiAlgebraic Graphs, Unnamed Item, Bipartite Independence Number in Graphs with Bounded Maximum Degree, Turán numbers of theta graphs, Unnamed Item, The size‐Ramsey number of powers of bounded degree trees, The Size Ramsey Number of Graphs with Bounded Treewidth, The Uniformity Conjecture in Additive Combinatorics, Turán Problems and Shadows III: Expansions of Graphs, Drawing Shortest Paths in Geodetic Graphs, Spanning surfaces in \(3\)-graphs, Turán numbers for hypergraph star forests, Spectral extremal graphs for intersecting cliques, Multicolour Turán problems, A variation of a classical Turán-type extremal problem, A semi-algebraic version of Zarankiewicz's problem, Size and structure of large \((s,t)\)-union intersecting families, The spectral radius of graphs with no intersecting odd cycles, Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\), Minimum \(H\)-decompositions of graphs, Additive approximation for edge-deletion problems, Some extremal results on hypergraph Turán problems, A generalization of a question asked by B. H. Neumann, On extremal problems of graphs and generalized graphs, The number of copies of \(K_{2,t+1}\) in a graph, A note on the maximum size of Berge-\( C_4\)-free hypergraphs, Odd length: odd diagrams and descent classes, The exact fitting problem in higher dimensions, Clique immersion in graphs without a fixed bipartite graph, Extremal functions of forbidden multidimensional matrices, Induced Ramsey number for a star versus a fixed graph, Forbidding \(K_{2,t}\) traces in triple systems, Additive structures on \(f\)-vector sets of polytopes, Forbidding multiple copies of forestable graphs, An average degree condition for independent transversals, Constructing sparse Davenport-Schinzel sequences, The number of 4-cycles in a graph, Stability results for vertex Turán problems in Kneser graphs, The Turán number of blow-ups of trees, Minimum degree conditions for small percolating sets in bootstrap percolation, Applying extremal graph theory to a question on finite groups, Bipartite Turán problems for ordered graphs, The number of multiplicative Sidon sets of integers, Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles, On sets of integers whose shifted products are powers, Some tight lower bounds for Turán problems via constructions of multi-hypergraphs, The multicolour size-Ramsey number of powers of paths, Finding unavoidable colorful patterns in multicolored graphs, Orthonormal representations of \(H\)-free graphs, The polynomial method over varieties, The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\), On a conjecture of Erdős and Simonovits: even cycles, Regular partitions of gentle graphs, Extremal problems on distance spectra of graphs, Two Erdős-Hajnal-type theorems in hypergraphs, A linear hypergraph extension of the bipartite Turán problem, Large cliques in hypergraphs with forbidden substructures, Degree bipartite Ramsey numbers, On the cover Turán number of Berge hypergraphs, A note on the Turán number of disjoint union of wheels, More on the extremal number of subdivisions, A spectral version of Mantel's theorem, Adjacency eigenvalues of graphs without short odd cycles, Unavoidable hypergraphs, Bipartite Ramsey numbers of \(K_{t,s}\) in many colors, On the rational Turán exponents conjecture, Clumsy packings of graphs, Improved bounds for the extremal number of subdivisions, Properly colored \(C_4\)'s in edge-colored graphs, Ramsey-goodness -- and otherwise, Some sharp results on the generalized Turán numbers, Intersection reverse sequences and geometric applications., A variation of the Erdős-Sós conjecture in bipartite graphs, On grids in point-line arrangements in the plane, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, Some extremal results on 4-cycles, A note on stability for maximal \(F\)-free graphs, Degenerate Turán densities of sparse hypergraphs, The Ramsey number of Fano plane versus tight path, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, On some extremal problems on \(r\)-graphs, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, An upper bound for the restricted online Ramsey number, Large cycles in graphs, A hypergraph extension of the bipartite Turán problem, The number of graphs without forbidden subgraphs, Counting copies of a fixed subgraph in \(F\)-free graphs, Graphs without quadrilaterals, Density and dimension, Compactness results in extremal graph theory, A jump to the Bell number for hereditary graph properties, Generalized Turán problems for complete bipartite graphs, Ramsey functions involving \(K_{m,n}\) with \(n\) large, On subgraphs of tripartite graphs, In absence of long chordless cycles, large tree-width becomes a local phenomenon, On generalized Ramsey theory: The bipartite case, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, Multicolor bipartite Ramsey numbers for quadrilaterals and stars, On the mutual visibility in Cartesian products and triangle-free graphs, A hierarchy of randomness for graphs, Subdivisions of a large clique in \(C_6\)-free graphs, Tight bounds for powers of Hamilton cycles in tournaments, A very simple function that requires exponential size read-once branching programs., Counting independent sets in graphs, Cancellation-free circuits in unbounded and bounded depth, Almost-spanning subgraphs with bounded degree in dense graphs, Density of balanced 3-partite graphs without 3-cycles or 4-cycles, Inverse Turán numbers, Meyniel extremal families of abelian Cayley graphs, Concentration estimates for algebraic intersections, Incidences of cubic curves in finite fields, Incidence‐free sets and edge domination in incidence graphs, Rainbow Saturation for Complete Graphs, On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model, Random polynomial graphs for random Turán problems, Four-vertex traces of finite sets, A note on 3‐partite graphs without 4‐cycles, On the power of threshold-based algorithms for detecting cycles in the CONGEST model, Embedding bipartite distance graphs under Hamming metric in finite fields, The Turán number of the grid, Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs, Turán numbers of several bipartite graphs, Dirac-type conditions for spanning bounded-degree hypertrees, Spectral Turán problems for intersecting even cycles, Exact values for some unbalanced Zarankiewicz numbers
