On a problem of K. Zarankiewicz
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Bipartite Ramsey numbers involving large \(K_{n,n}\)
- Extremal problems on triangle areas in two and three dimensions
- Stability of the path-path Ramsey number
- On a class of degenerate extremal graph problems
- On the use of senders in generalized Ramsey theory for graphs
- A note on the complexity of finding regular subgraphs
- On another Boolean matrix
- A new result on the problem of Zarankiewicz
- On the combinatorial problems which I would most like to see solved
- Neighborhood conditions and edge-disjoint perfect matchings
- Davenport-Schinzel theory of matrices
- On embedding of graphs into Euclidean spaces of small dimension
- A problem of Zarankiewicz
- On complete subgraphs of r-chromatic graphs
- Combinatorial problems on the existence of large submatrices. I
- On graphs which contain all small trees
- Induced subgraphs of given sizes
- Popular distances in 3-space
- Norm-graphs: Variations and applications
- Bounds on certain multiplications of affine combinations
- Many-face complexity in incremental convex arrangements
- Erased arrangements of linear and convex decompositions of polyhedra
- New upper bound for multicolor Ramsey number of odd cycles
- Degenerate Turán problems for hereditary properties
- On ordered Ramsey numbers of bounded-degree graphs
- A crossing lemma for Jordan curves
- Stability results for graphs with a critical edge
- Some extremal results on complete degenerate hypergraphs
- On the local approach to Sidorenko's conjecture
- Symmetric sums of squares over \(k\)-subset hypercubes
- Bipartite algebraic graphs without quadrilaterals
- Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations
- Short lists with short programs in short time
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- Forbidden subposet problems for traces of set families
- Pseudo-random hypergraphs
- Perfect error-correcting databases
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- A hypergraph extension of the bipartite Turán problem
- The number of graphs without forbidden subgraphs
- Graphs without quadrilaterals
- Density and dimension
- Compactness results in extremal graph theory
- On generalized Ramsey theory: The bipartite case
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Almost-spanning subgraphs with bounded degree in dense graphs
- Multicolour Turán problems
- A variation of a classical Turán-type extremal problem
- The exact fitting problem in higher dimensions
- On the cover Turán number of Berge hypergraphs
- A note on the Turán number of disjoint union of wheels
- Unavoidable hypergraphs
- 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
- Some sharp results on the generalized Turán numbers
- A variation of the Erdős-Sós conjecture in bipartite graphs
- On grids in point-line arrangements in the plane
- Some extremal results on 4-cycles
- A note on stability for maximal \(F\)-free graphs
- Bounded VC-dimension implies the Schur-Erdős conjecture
- Generalized Turán problems for complete bipartite graphs
- On subgraphs of tripartite graphs
- Multicolor bipartite Ramsey numbers for quadrilaterals and stars
- On the mutual visibility in Cartesian products and triangle-free graphs
- Tight bounds for powers of Hamilton cycles in tournaments
- Density of balanced 3-partite graphs without 3-cycles or 4-cycles
- Inverse Turán numbers
- Meyniel extremal families of abelian Cayley graphs
- Spanning surfaces in \(3\)-graphs
- Turán numbers for hypergraph star forests
- Spectral extremal graphs for intersecting cliques
- 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}\)
- Some extremal results on hypergraph Turán problems
- A generalization of a question asked by B. H. Neumann
- The number of copies of \(K_{2,t+1}\) in a graph
- Clique immersion in graphs without a fixed bipartite graph
- Additive structures on f-vector sets of polytopes
- Forbidding multiple copies of forestable graphs
- Constructing sparse Davenport-Schinzel sequences
- Minimum degree conditions for small percolating sets in bootstrap percolation
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
- 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)\)
- 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
- More on the extremal number of subdivisions
- A spectral version of Mantel's theorem
- Adjacency eigenvalues of graphs without short odd cycles
This page was built for publication: On a problem of K. Zarankiewicz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5825672)
