Clique density vs blowups
From MaRDI portal
Cites work
- A bipartite analogue of Dilworth's theorem
- A positive fraction Erdős-Szekeres theorem and its applications
- A sharp threshold phenomenon in string graphs
- An upper bound for spherical caps
- Bipartite Turán problems for ordered graphs
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Forbidden paths and cycles in ordered graphs and matrices
- Graphs with many r -cliques have large complete r -partite subgraphs
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Large cliques in hypergraphs with forbidden substructures
- On a Ramsey-Turán type problem
- On ordered Ramsey numbers of bounded-degree graphs
- On the optimality of the random hyperplane rounding technique for MAX CUT
- On the Ramsey-Turán numbers of graphs and hypergraphs
- On the Structure of Edge Graphs II
- On the structure of linear graphs
- On the Turán number of ordered forests
- Ordered graphs and large bi-cliques in intersection graphs of curves
- Ordered Ramsey numbers
- Ramsey-type theorems
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Supersaturated graphs and hypergraphs
- The critical window for the classical Ramsey-Turán problem
- The Vapnik-Chervonenkis dimension of a random graph
- Turán-type results for complete h-partite graphs in comparability and incomparability graphs
- Turán-type results for partial orders and intersection graphs of convex sets
This page was built for publication: Clique density vs blowups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303692)
