A new upper bound for diagonal Ramsey numbers
From MaRDI portal
Publication:731208
DOI10.4007/ANNALS.2009.170.941zbMATH Open1188.05087arXivmath/0607788OpenAlexW2034622005WikidataQ55969771 ScholiaQ55969771MaRDI QIDQ731208FDOQ731208
Authors: David Conlon 
Publication date: 2 October 2009
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Abstract: We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant such that [r(k+1, k+1) leq k^{- C frac{log k}{log log k}} �inom{2k}{k}.]
Full work available at URL: https://arxiv.org/abs/math/0607788
Recommendations
Cites Work
Cited In (80)
- Ramsey numbers for multiple copies of sparse graphs
- Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates
- On minimal Ramsey graphs and Ramsey equivalence in multiple colours
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- The minimum degree of minimal Ramsey graphs for cliques
- On the use of senders for asymmetric tuples of cliques in Ramsey theory
- One problem on geometric Ramsey numbers
- Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
- Ramsey numbers of sparse digraphs
- Interview with David Conlon
- The pigeonhole principle and multicolor Ramsey numbers
- Large unavoidable subtournaments
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
- Minimal Ramsey graphs with many vertices of small degree
- New bounds for the distance Ramsey number
- Two extensions of Ramsey's theorem
- A large number of \(m\)-coloured complete infinite subgraphs
- Online Ramsey numbers and the subgraph query problem
- Exactly \(m\)-coloured complete infinite subgraphs
- Large almost monochromatic subsets in hypergraphs
- A note on on-line Ramsey numbers of stars and paths
- Complete graphs and complete bipartite graphs without rainbow path
- Turán theorems for unavoidable patterns
- All quadrilateral-wheel planar Ramsey numbers
- Computation of new diagonal graph Ramsey numbers
- Two remarks on the Burr-Erdős conjecture
- A new upper bound for the bipartite Ramsey problem
- For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- An improved lower bound on multicolor Ramsey numbers
- Ramsey-type results for semi-algebraic relations
- Lower bounds for multicolor Ramsey numbers
- On the minimum degree of minimal Ramsey graphs for multiple colours
- On distance subgraphs of graphs in spaces of lower dimensions
- Upper bounds on positional Paris-Harrington games
- Off-diagonal hypergraph Ramsey numbers
- Tidier examples for lower bounds on diagonal Ramsey numbers
- Two problems in graph Ramsey theory
- Threshold Ramsey multiplicity for odd cycles
- On the multicolor Ramsey number of a graph with \(m\) edges
- Ramsey numbers of books and quasirandomness
- Title not available (Why is that?)
- On Ramsey numbers for arbitrary sequences of graphs
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- Large unavoidable subtournaments
- On two problems in graph Ramsey theory
- What is Ramsey-equivalent to a clique?
- On a diagonal conjecture for classical Ramsey numbers
- All complete graph-wheel planar Ramsey numbers
- Hereditary quasirandomness without regularity
- Induced Ramsey-type theorems
- Ramsey numbers of sparse hypergraphs
- Blowup Ramsey numbers
- Extremal results in sparse pseudorandom graphs
- Hypergraph Ramsey numbers
- An approximate version of Sidorenko's conjecture
- Unavoidable patterns
- Title not available (Why is that?)
- The Ramsey number of the clique and the hypercube
- Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
- Ramsey numbers of ordered graphs
- A conjecture of Erdős on graph Ramsey numbers
- An upper bound for some ramsey numbers
- The triangle-free process and the Ramsey number \(R(3,k)\)
- A precise threshold for quasi-Ramsey numbers
- Off-diagonal book Ramsey numbers
- Ramsey numbers of connected clique matchings
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- F$F$‐factors in Quasi‐random Hypergraphs
- Distance Ramsey numbers
- Title not available (Why is that?)
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- Triangular Ramsey numbers
- Diagonal Ramsey via effective quasirandomness
- An improved bound for the stepping-up lemma
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- A note on the Erdős-Hajnal hypergraph Ramsey problem
- Ordered Ramsey numbers
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Title not available (Why is that?)
This page was built for publication: A new upper bound for diagonal Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731208)
