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)- A remark on the Ramsey number of the hypercube
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- On plane subgraphs of complete topological drawings
- Remarks on the application of Ramsey numbers to bounding the sum of densities of a graph and its complement
- Ramsey properties of algebraic graphs and hypergraphs
- Saturated simple and \(k\)-simple topological graphs
- On globally sparse Ramsey graphs
- Ramsey numbers for multiple copies of sparse graphs
- A conjecture of Erdős on graph Ramsey numbers
- On two problems in graph Ramsey theory
- Ramsey-goodness -- and otherwise
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- The Ramsey number of the clique and the hypercube
- The Erdős-Hajnal conjecture for rainbow triangles
- Ordered Ramsey numbers
- Ramsey good graphs with long suspended paths
- Shooting stars in simple drawings of \(K_{m,n}\)
- Two remarks on the Burr-Erdős conjecture
- For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
- Unavoidable patterns
- Twisted ways to find plane structures in simple drawings of complete graphs
- The critical window for the classical Ramsey-Turán problem
- On the extremal number of subdivisions
- On the bipartite density of regular graphs with large girth
- On the multicolor Ramsey number of a graph with \(m\) edges
- Disjoint edges in complete topological graphs
- Ramsey numbers of cubes versus cliques
- Ramsey numbers upon vertex deletion
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 1552836 (Why is no real title available?)
- A note on induced Ramsey numbers
- Erdős-Hajnal-type theorems in hypergraphs
- The Erdős-Hajnal conjecture for paths and antipaths
- Many disjoint edges in topological graphs
- An efficient container lemma
- Excluding hooks and their complements
- Ramsey number of 1-subdivisions of transitive tournaments
- The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
- The Erdős-Hajnal conjecture. A survey
- Erdős-Hajnal-type results for monotone paths
- Short proofs of some extremal results. III
- Dependent random choice
- On the Ramsey number of the triangle and the cube
- Short proofs of some extremal results. II.
- Induced Ramsey-type theorems
- Ramsey numbers of sparse hypergraphs
- An approximate version of Sidorenko's conjecture
- On the strength of König's duality theorem for countable bipartite graphs
- Forcing a sparse minor
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Many disjoint edges in topological graphs
- Monochromatic bounded degree subgraph partitions
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)
