The following pages link to On a problem of K. Zarankiewicz (Q5825672):
Displaying 50 items.
- Almost all permutation matrices have bounded saturation functions (Q831345) (← links)
- A contribution to the Zarankiewicz problem (Q846298) (← links)
- Forbidden subgraphs in the norm graph (Q906463) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Unavoidable subgraphs of colored graphs (Q941378) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- A separation theorem in property testing (Q949795) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Note on robust critical graphs with large odd girth (Q960960) (← links)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- Bipartite Ramsey numbers involving large \(K_{n,n}\) (Q1024286) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Stability of the path-path Ramsey number (Q1043993) (← links)
- On a class of degenerate extremal graph problems (Q1055428) (← links)
- On the use of senders in generalized Ramsey theory for graphs (Q1057876) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- On another Boolean matrix (Q1137982) (← links)
- A new result on the problem of Zarankiewicz (Q1158160) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Neighborhood conditions and edge-disjoint perfect matchings (Q1179275) (← links)
- Davenport-Schinzel theory of matrices (Q1195475) (← links)
- On embedding of graphs into Euclidean spaces of small dimension (Q1204473) (← links)
- A problem of Zarankiewicz (Q1213446) (← links)
- On complete subgraphs of \(r\)-chromatic graphs (Q1217812) (← links)
- Combinatorial problems on the existence of large submatrices. I (Q1237735) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- Popular distances in 3-space (Q1301635) (← links)
- Norm-graphs: Variations and applications (Q1306316) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Many-face complexity in incremental convex arrangements (Q1336754) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- New upper bound for multicolor Ramsey number of odd cycles (Q1618240) (← links)
- Degenerate Turán problems for hereditary properties (Q1630890) (← links)
- On ordered Ramsey numbers of bounded-degree graphs (Q1633749) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Stability results for graphs with a critical edge (Q1671746) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- On the local approach to Sidorenko's conjecture (Q1689957) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Bipartite algebraic graphs without quadrilaterals (Q1744742) (← links)
- Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations (Q1744829) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices (Q1752672) (← links)
- Forbidden subposet problems for traces of set families (Q1784275) (← links)
- Pseudo-random hypergraphs (Q1812585) (← links)
- Perfect error-correcting databases (Q1813978) (← links)
