On a problem of K. Zarankiewicz
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Upper bounds on the extremal number of the 4‐cycle
- Testing whether a digraph contains H-free k-induced subgraphs
- Posets are easily testable
- Many \(T\) copies in \(H\)-free graphs
- A bipartite version of the Erdős–McKay conjecture
- Many \(T\) copies in \(H\)-free graphs
- The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
- Adjacency eigenvalues of graphs without short odd cycles
- Unavoidable hypergraphs
- Bipartite Ramsey numbers of \(K_{t,s}\) in many colors
- Rainbow Saturation for Complete Graphs
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
- Graphs with few paths of prescribed length between any two vertices
- A note on stability for maximal \(F\)-free graphs
- On the union complexity of diametral disks
- A new approach for the Brown-Erdős-Sós problem
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- A neighborhood condition which implies the existence of a complete multipartite subgraph
- The extremal function for partial bipartite tilings
- Supersaturation beyond color-critical graphs
- The de Bruijn-Erdős theorem for hypergraphs
- Note on robust critical graphs with large odd girth
- Regular partitions of gentle graphs
- Almost all permutation matrices have bounded saturation functions
- Edge-disjoint cycles with the same vertex set
- Constructive lower bounds for off-diagonal Ramsey numbers
- Turán numbers for hypergraph star forests
- The exact fitting problem in higher dimensions
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- Extremal Betti numbers of Vietoris-Rips complexes
- Almost-spanning subgraphs with bounded degree in dense graphs
- A hierarchy of randomness for graphs
- On the Turán number of ordered forests
- Unavoidable patterns in 2-colorings of the complete bipartite graph
- A new result on the problem of Zarankiewicz
- Color isomorphic even cycles and a related Ramsey problem
- Side-contact representations with convex polygons in 3D: new results for complete bipartite graphs
- Phase transitions of structured codes of graphs
- Anticoncentration for subgraph statistics
- On the local approach to Sidorenko's conjecture
- Some sharp results on the generalized Turán numbers
- A problem of Zarankiewicz
- Two Ramsey problems in blowups of graphs
- Extremal edge polytopes
- Hamiltonian cycles with all small even chords
- Hypergraph anti-Ramsey theorems
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- On Turán exponents of bipartite graphs
- Turán theorems for unavoidable patterns
- Density of balanced 3-partite graphs without 3-cycles or 4-cycles
- Multicolor bipartite Ramsey numbers for quadrilaterals and stars
- Spectral extremal graphs for intersecting cliques
- Multi-color Ramsey numbers of two bipartite graphs
- On the Zarankiewicz problem for intersection hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- The spectral radius of graphs with no intersecting odd cycles
- Applying the Kövári-Sós-Turán theorem to a question in group theory
- Turán numbers of bipartite subdivisions
- Improved bounds for the extremal number of subdivisions
- Covering and tiling hypergraphs with tight cycles
- Random polynomial graphs for random Turán problems
- Four-vertex traces of finite sets
- Density and dimension
- Extremal results for random discrete structures
- Strong blocking sets and minimal codes from expander graphs
- A variation of the Erdős-Sós conjecture in bipartite graphs
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- Clumsy packings of graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- Counting independent sets in graphs
- ETH-hardness of approximating 2-CSPs and directed Steiner network
- Meyniel extremal families of abelian Cayley graphs
- Spanning surfaces in \(3\)-graphs
- Turán numbers of theta graphs
- The Ramsey number of Fano plane versus tight path
- Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans
- A variation of a classical Turán-type extremal problem
- An efficient asymmetric removal lemma and its limitations
- The number of cliques in hypergraphs with forbidden subgraphs
- Exact bipartite Turán numbers of large even cycles
- Forbidding multiple copies of forestable graphs
- Breaking the degeneracy barrier for coloring graphs with no K_t minor
- A note on 3‐partite graphs without 4‐cycles
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model
- The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph
- Upper bounds for linear graph codes
- Size and structure of large \((s,t)\)-union intersecting families
- A randomized embedding algorithm for trees
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Induced C₄-free subgraphs with large average degree
- On multiplicative bases of finite sets
- New upper bound for multicolor Ramsey number of odd cycles
- Structured Codes of Graphs
- String graphs and incomparability graphs
- Zarankiewicz numbers near the triple system threshold
- Bipartite algebraic graphs without quadrilaterals
- Harary polynomials
- A note on the maximum size of Berge-\( C_4\)-free hypergraphs
- Minimum degree conditions for small percolating sets in bootstrap percolation
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)
