Density theorems for bipartite graphs and related Ramsey-type results
From MaRDI portal
Publication:987552
DOI10.1007/S00493-009-2475-5zbMath1212.05261arXiv0707.4159OpenAlexW2137669983WikidataQ126592230 ScholiaQ126592230MaRDI QIDQ987552
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.4159
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)
Related Items (48)
Ramsey properties of algebraic graphs and hypergraphs ⋮ On the bipartite density of regular graphs with large girth ⋮ Short proofs of some extremal results. II. ⋮ On the Extremal Number of Subdivisions ⋮ For most graphs H , most H -free graphs have a linear homogeneous set ⋮ Ramsey number of 1-subdivisions of transitive tournaments ⋮ Excluding hooks and their complements ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ On two problems in graph Ramsey theory ⋮ Ramsey good graphs with long suspended paths ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ On globally sparse Ramsey graphs ⋮ An approximate version of Sidorenko's conjecture ⋮ Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ A Note on Induced Ramsey Numbers ⋮ Forcing a sparse minor ⋮ Many disjoint edges in topological graphs ⋮ Ordered Ramsey numbers ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Ramsey numbers for multiple copies of sparse graphs ⋮ Monochromatic bounded degree subgraph partitions ⋮ Erdős-Hajnal-type results for monotone paths ⋮ On plane subgraphs of complete topological drawings ⋮ Many disjoint edges in topological graphs ⋮ Induced Ramsey-type theorems ⋮ Ramsey numbers of cubes versus cliques ⋮ On the Ramsey number of the triangle and the cube ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Unavoidable patterns ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Ramsey-goodness -- and otherwise ⋮ The Erdős-Hajnal conjecture for rainbow triangles ⋮ Erdős-Hajnal-type theorems in hypergraphs ⋮ Ramsey numbers upon vertex deletion ⋮ A remark on the Ramsey number of the hypercube ⋮ Dependent random choice ⋮ Disjoint edges in complete topological graphs ⋮ On the multicolor Ramsey number of a graph with \(m\) edges ⋮ Ramsey numbers of sparse hypergraphs ⋮ An efficient container lemma ⋮ Short proofs of some extremal results III ⋮ The Ramsey number of the clique and the hypercube ⋮ Two remarks on the Burr-Erdős conjecture ⋮ Saturated simple and \(k\)-simple topological graphs ⋮ The Erdős-Hajnal conjecture for paths and antipaths ⋮ The Erdös-Hajnal Conjecture-A Survey
This page was built for publication: Density theorems for bipartite graphs and related Ramsey-type results
