Density theorems for bipartite graphs and related Ramsey-type results
From MaRDI portal
(Redirected from Publication:987552)
Abstract: In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve and generalize earlier results of various researchers. The proofs combine probabilistic arguments with some combinatorial ideas. In addition, these techniques can be used to study properties of graphs with a forbidden induced subgraph, edge intersection patterns in topological graphs, and to obtain several other Ramsey-type statements.
Recommendations
Cited in
(52)- On globally sparse Ramsey graphs
- Ordered Ramsey numbers
- Ramsey numbers for multiple copies of sparse graphs
- Two remarks on the Burr-Erdős conjecture
- A remark on the Ramsey number of the hypercube
- Forcing a sparse minor
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Dependent random choice
- Twisted ways to find plane structures in simple drawings of complete graphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Ramsey good graphs with long suspended paths
- Ramsey properties of algebraic graphs and hypergraphs
- 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
- Short proofs of some extremal results. II.
- On two problems in graph Ramsey theory
- A note on induced Ramsey numbers
- Saturated simple and \(k\)-simple topological graphs
- Erdős-Hajnal-type theorems in hypergraphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Induced Ramsey-type theorems
- Ramsey numbers of sparse hypergraphs
- Excluding hooks and their complements
- An approximate version of Sidorenko's conjecture
- On the extremal number of subdivisions
- Unavoidable patterns
- Ramsey number of 1-subdivisions of transitive tournaments
- Ramsey numbers of cubes versus cliques
- For most graphs H, most H-free graphs have a linear homogeneous set
- The Ramsey number of the clique and the hypercube
- Short proofs of some extremal results. III
- A conjecture of Erdős on graph Ramsey numbers
- scientific article; zbMATH DE number 1552836 (Why is no real title available?)
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- 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
- The critical window for the classical Ramsey-Turán problem
- 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}\)
- 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
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)
