Density theorems for bipartite graphs and related Ramsey-type results
DOI10.1007/S00493-009-2475-5zbMATH Open1212.05261arXiv0707.4159OpenAlexW2137669983WikidataQ126592230 ScholiaQ126592230MaRDI QIDQ987552FDOQ987552
Authors: Jacob Fox, Benny Sudakov 
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.4159
Recommendations
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cited In (52)
- Ramsey numbers for multiple copies of sparse graphs
- A remark on the Ramsey number of the hypercube
- On globally sparse Ramsey graphs
- Forcing a sparse minor
- Two remarks on the Burr-Erdős conjecture
- Twisted ways to find plane structures in simple drawings of complete graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Dependent random choice
- The Erdős-Hajnal conjecture for rainbow triangles
- For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
- Ramsey properties of algebraic graphs and hypergraphs
- Ramsey good graphs with long suspended paths
- An efficient container lemma
- Monochromatic bounded degree subgraph partitions
- On the bipartite density of regular graphs with large girth
- The Erdős-Hajnal conjecture for paths and antipaths
- The Erdős-Hajnal conjecture. A survey
- Erdős-Hajnal-type results for monotone paths
- On the multicolor Ramsey number of a graph with \(m\) edges
- Many disjoint edges in topological graphs
- A note on induced Ramsey numbers
- Short proofs of some extremal results. II.
- On two problems in graph Ramsey theory
- Saturated simple and \(k\)-simple topological graphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Erdős-Hajnal-type theorems in hypergraphs
- Induced Ramsey-type theorems
- Ramsey numbers of sparse hypergraphs
- On the extremal number of subdivisions
- Excluding hooks and their complements
- An approximate version of Sidorenko's conjecture
- Unavoidable patterns
- Ramsey number of 1-subdivisions of transitive tournaments
- The Ramsey number of the clique and the hypercube
- Ramsey numbers of cubes versus cliques
- Short proofs of some extremal results. III
- Title not available (Why is that?)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- A conjecture of Erdős on graph Ramsey numbers
- The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
- Remarks on the application of Ramsey numbers to bounding the sum of densities of a graph and its complement
- Disjoint edges in complete topological graphs
- Many disjoint edges in topological graphs
- On plane subgraphs of complete topological drawings
- Shooting stars in simple drawings of \(K_{m,n}\)
- The critical window for the classical Ramsey-Turán problem
- Ramsey numbers upon vertex deletion
- On the strength of König's duality theorem for countable bipartite graphs
- On the Ramsey number of the triangle and the cube
- Ramsey-goodness -- and otherwise
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Ordered Ramsey numbers
This page was built for publication: Density theorems for bipartite graphs and related Ramsey-type results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987552)
