Recent developments in graph Ramsey theory

DOI10.1017/CBO9781316106853.003zbMATH Open1352.05123arXiv1501.02474OpenAlexW2962706453MaRDI QIDQ3179072FDOQ3179072

David Conlon, Jacob Fox, Benny Sudakov

Publication date: 20 December 2016

Published in: Surveys in Combinatorics 2015 (Search for Journal in Brave)

Abstract: Given a graph $H$, the Ramsey number $r(H)$ is the smallest natural number $N$ such that any two-colouring of the edges of $K_N$ contains a monochromatic copy of $H$. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress.

Full work available at URL: https://arxiv.org/abs/1501.02474

Recommendations

• Changing views of Ramsey numbers
• A survey of hypergraph Ramsey problems
• The Ramsey number of dense graphs
• Some recent results on Ramsey-type numbers
• scientific article

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cited In (97)

• The Erdős–Gyárfás function with respect to Gallai‐colorings
• A note on equitable Hamiltonian cycles
• Short proofs of some extremal results III
• The size‐Ramsey number of powers of bounded degree trees
• On off-diagonal ordered Ramsey numbers of nested matchings
• Distinct degrees and homogeneous sets
• Title not available (Why is that?)
• Ramsey numbers of cycles versus general graphs
• Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
• Multicolour bipartite Ramsey number of paths
• Strong Ramsey games: drawing on an infinite board
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Ramsey numbers of hedgehogs
• Multicolor Ramsey numbers for Berge cycles
• Non-monochromatic triangles in a 2-edge-coloured graph
• The Ramsey number of Fano plane versus tight path
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Degree Ramsey numbers for even cycles
• Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs
• Packing nearly optimal Ramsey \(R(3,t)\) graphs
• Suitable sets of permutations, packings of triples, and Ramsey's theorem
• Turán‐ and Ramsey‐type results for unavoidable subgraphs
• The size‐Ramsey number of short subdivisions
• Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
• Edges not in any monochromatic copy of a fixed graph
• On a Question of Erdös and Faudree on the Size Ramsey Numbers
• The size Ramsey number of short subdivisions of bounded degree graphs
• Threshold Ramsey multiplicity for odd cycles
• Fundamental limits of exact support recovery in high dimensions
• Improved bounds on the Ramsey number of fans
• Spectral edge in sparse random graphs: upper and lower tail large deviations
• On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• Title not available (Why is that?)
• Ramsey Problems for Berge Hypergraphs
• A note on restricted online Ramsey numbers of matchings
• Minimal Ramsey Graphs with Many Vertices of Small Degree
• Saturation numbers for Ramsey-minimal graphs
• Distinct degrees in induced subgraphs
• On the Lower Tail Variational Problem for Random Graphs
• Ramsey numbers of ordered graphs
• The multicolour size-Ramsey number of powers of paths
• Ramsey numbers of uniform loose paths and cycles
• The Ramsey number for a forest versus disjoint union of complete graphs
• The Ramsey number of 3-uniform loose path versus star
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• A new bound for the Brown-Erdős-Sós problem
• Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
• Threshold Ramsey multiplicity for paths and even cycles
• On 1-subdivisions of transitive tournaments
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• On ordered Ramsey numbers of bounded-degree graphs
• Tower-type bounds for unavoidable patterns in words
• Diagonal Ramsey via effective quasirandomness
• Finding unavoidable colorful patterns in multicolored graphs
• The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
• On edge‐ordered Ramsey numbers
• Hypergraph Ramsey numbers of cliques versus stars
• On the Size-Ramsey Number of Cycles
• A note on multicolor Ramsey number of small odd cycles versus a large clique
• Bipartite Ramsey numbers for graphs of small bandwidth
• A Note on Induced Ramsey Numbers
• Algorithmic obstructions in the random number partitioning problem
• Ramsey numbers for multiple copies of sparse graphs
• Ramsey Equivalence for Asymmetric Pairs of Graphs
• The growth rate of multicolor Ramsey numbers of 3-graphs
• A large tree is \(tK_m\)-good
• Off-diagonal commonality of graphs via entropy
• On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
• Common graphs with arbitrary connectivity and chromatic number
• Two multicolor Ramsey numbers involving bipartite graphs
• The minimum degree of minimal Ramsey graphs for cliques
• List Ramsey numbers
• Multicolor list Ramsey numbers grow exponentially
• On locally rainbow colourings
• Pure Pairs. IX. Transversal Trees
• Recent developments on unavoidable patterns in 2-colorings of the complete graph
• Ramsey numbers of sparse digraphs
• On off-diagonal ordered Ramsey numbers of nested matchings
• Ramsey Goodness of Clique Versus Paths in Random Graphs
• Graphs of large chromatic number
• Ramsey numbers with prescribed rate of growth
• On a conjecture of Conlon, Fox, and Wigderson
• Title not available (Why is that?)
• Ramsey numbers of Boolean lattices
• Growth rates of the bipartite Erdős-Gyárfás function
• Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
• The (t−1) $(t-1)$‐chromatic Ramsey number for paths
• Multicolored Bipartite Ramsey Numbers of Large Cycles
• Ramsey numbers of large books versus multipartite graphs
• EPPA numbers of graphs
• Online Ramsey numbers of ordered paths and cycles
• Ramsey non-goodness involving books
• Star-critical Ramsey numbers involving large books
• A lower bound for set‐coloring Ramsey numbers
• Rolling backwards can move you forward: On embedding problems in sparse expanders

This page was built for publication: Recent developments in graph Ramsey theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179072)