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

Jacob Fox, Benjamin 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




Related Items (43)

Ramsey properties of algebraic graphs and hypergraphsShort proofs of some extremal results. II.On the Extremal Number of SubdivisionsRamsey number of 1-subdivisions of transitive tournamentsExcluding hooks and their complementsDegeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphsOn two problems in graph Ramsey theoryRamsey good graphs with long suspended pathsErdős-Hajnal conjecture for graphs with bounded VC-dimensionOn globally sparse Ramsey graphsAn approximate version of Sidorenko's conjectureShooting stars in simple drawings of \(K_{m,n}\)Twisted ways to find plane structures in simple drawings of complete graphsA Note on Induced Ramsey NumbersForcing a sparse minorMany disjoint edges in topological graphsOrdered Ramsey numbersChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-FajtlowiczEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsMonochromatic bounded degree subgraph partitionsErdős-Hajnal-type results for monotone pathsOn plane subgraphs of complete topological drawingsMany disjoint edges in topological graphsInduced Ramsey-type theoremsRamsey numbers of cubes versus cliquesOn the Ramsey number of the triangle and the cubeThe critical window for the classical Ramsey-Turán problemUnavoidable patternsA conjecture of Erdős on graph Ramsey numbersRamsey-goodness -- and otherwiseThe Erdős-Hajnal conjecture for rainbow trianglesErdős-Hajnal-type theorems in hypergraphsDependent random choiceDisjoint edges in complete topological graphsOn the multicolor Ramsey number of a graph with \(m\) edgesRamsey numbers of sparse hypergraphsAn efficient container lemmaShort proofs of some extremal results IIIThe Ramsey number of the clique and the hypercubeTwo remarks on the Burr-Erdős conjectureSaturated simple and \(k\)-simple topological graphsThe Erdős-Hajnal conjecture for paths and antipathsThe Erdös-Hajnal Conjecture-A Survey




This page was built for publication: Density theorems for bipartite graphs and related Ramsey-type results