A new upper bound for diagonal Ramsey numbers
From MaRDI portal
Publication:731208
DOI10.4007/annals.2009.170.941zbMath1188.05087arXivmath/0607788OpenAlexW2034622005WikidataQ55969771 ScholiaQ55969771MaRDI QIDQ731208
Publication date: 2 October 2009
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0607788
Related Items
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Distance Ramsey numbers ⋮ Computation of new diagonal graph Ramsey numbers ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Two problems in graph Ramsey theory ⋮ On Ramsey numbers for arbitrary sequences of graphs ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Large unavoidable subtournaments ⋮ Turán theorems for unavoidable patterns ⋮ Ramsey-type results for semi-algebraic relations ⋮ Off-diagonal hypergraph Ramsey numbers ⋮ For most graphs H , most H -free graphs have a linear homogeneous set ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Hereditary quasirandomness without regularity ⋮ A note on the Erdős-Hajnal hypergraph Ramsey problem ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ On two problems in graph Ramsey theory ⋮ An improved bound for the stepping-up lemma ⋮ A Precise Threshold for Quasi-Ramsey Numbers ⋮ New bounds for the distance Ramsey number ⋮ Two extensions of Ramsey's theorem ⋮ An approximate version of Sidorenko's conjecture ⋮ Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates ⋮ Diagonal Ramsey via effective quasirandomness ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ Exactly \(m\)-coloured complete infinite subgraphs ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Off-diagonal book Ramsey numbers ⋮ All complete graph-wheel planar Ramsey numbers ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ The pigeonhole principle and multicolor Ramsey numbers ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On distance subgraphs of graphs in spaces of lower dimensions ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ Large Unavoidable Subtournaments ⋮ Ordered Ramsey numbers ⋮ Extremal results in sparse pseudorandom graphs ⋮ What is Ramsey-equivalent to a clique? ⋮ Lower bounds for multicolor Ramsey numbers ⋮ Upper bounds on positional Paris-Harrington games ⋮ Blowup Ramsey numbers ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ A large number of \(m\)-coloured complete infinite subgraphs ⋮ Ramsey numbers of connected clique matchings ⋮ Ramsey numbers of ordered graphs ⋮ Induced Ramsey-type theorems ⋮ Unavoidable patterns ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Large almost monochromatic subsets in hypergraphs ⋮ One problem on geometric Ramsey numbers ⋮ Hypergraph Ramsey numbers ⋮ All quadrilateral-wheel planar Ramsey numbers ⋮ Triangular Ramsey Numbers ⋮ On the multicolor Ramsey number of a graph with \(m\) edges ⋮ Ramsey numbers of sparse hypergraphs ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ A new upper bound for the bipartite Ramsey problem ⋮ An improved lower bound on multicolor Ramsey numbers ⋮ The Ramsey number of the clique and the hypercube ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Two remarks on the Burr-Erdős conjecture ⋮ Ramsey numbers of books and quasirandomness ⋮ Unnamed Item
Cites Work
