Abstract: Given a graph , the Ramsey number is the smallest natural number such that any two-colouring of the edges of contains a monochromatic copy of . 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.
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- A new bound for the Brown-Erdős-Sós problem
- Online Ramsey numbers of ordered paths and cycles
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Common graphs with arbitrary chromatic number
- Ramsey non-goodness involving books
- Threshold Ramsey multiplicity for paths and even cycles
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Induced Ramsey problems for trees and graphs with bounded treewidth
- On 1-subdivisions of transitive tournaments
- Star-critical Ramsey numbers involving large books
- Graph theory. Abstracts from the workshop held January 5--10, 2025
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On ordered Ramsey numbers of bounded-degree graphs
- On the Kohayakawa-Kreuter conjecture
- Some recent results on Ramsey-type numbers
- Ramsey problems for Berge hypergraphs
- Finding unavoidable colorful patterns in multicolored graphs
- Ramsey goodness of clique versus paths in random graphs
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
- Tower-type bounds for unavoidable patterns in words
- A lower bound for set‐coloring Ramsey numbers
- Diagonal Ramsey via effective quasirandomness
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Hypergraph Ramsey numbers of cliques versus stars
- Bipartite Ramsey numbers for graphs of small bandwidth
- Ramsey goodness of k-uniform paths, or the lack thereof
- Refinement of homogeneity and Ramsey numbers
- A note on equitable Hamiltonian cycles
- Minimal Ramsey graphs with many vertices of small degree
- On off-diagonal ordered Ramsey numbers of nested matchings
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Distinct degrees and homogeneous sets
- scientific article; zbMATH DE number 3825881 (Why is no real title available?)
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- On the lower tail variational problem for random graphs
- Multicolour bipartite Ramsey number of paths
- Algorithmic obstructions in the random number partitioning problem
- Unavoidable patterns in 2-colorings of the complete bipartite graph
- Strong Ramsey games: drawing on an infinite board
- Ramsey numbers of cycles versus general graphs
- The Ramsey number of dense graphs
- Ramsey numbers for multiple copies of sparse graphs
- scientific article; zbMATH DE number 66615 (Why is no real title available?)
- Ramsey Equivalence for Asymmetric Pairs of Graphs
- Density of monochromatic infinite subgraphs. II
- scientific article; zbMATH DE number 3895091 (Why is no real title available?)
- A survey of hypergraph Ramsey problems
- Multicolor Ramsey numbers for Berge cycles
- Non-monochromatic triangles in a 2-edge-coloured graph
- The Ramsey number of Fano plane versus tight path
- On Ramsey numbers of hedgehogs
- Ramsey numbers for a large tree versus multiple copies of complete graphs of different sizes
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Degree Ramsey numbers for even cycles
- Packing nearly optimal Ramsey R(3,t) graphs
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Resolution of the Kohayakawa-Kreuter conjecture
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- Effective bounds for induced size-Ramsey numbers of cycles (extended abstract)
- Tight path, what is it (Ramsey-)good for? Absolutely (almost) nothing! (Extended abstract)
- On ordered Ramsey numbers of matchings versus triangles (extended abstract)
- A lower bound for set-colouring Ramsey numbers (extended abstract)
- The size‐Ramsey number of short subdivisions
- Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
- The growth rate of multicolor Ramsey numbers of 3-graphs
- A large tree is \(tK_m\)-good
- Edges not in any monochromatic copy of a fixed graph
- The size-Ramsey number of powers of bounded degree trees
- Ramsey numbers of hypergraphs with a given size
- Off-diagonal commonality of graphs via entropy
- On the size-Ramsey number of cycles
- On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Common graphs with arbitrary connectivity and chromatic number
- On a Question of Erdös and Faudree on the Size Ramsey Numbers
- Two multicolor Ramsey numbers involving bipartite graphs
- Changing views of Ramsey numbers
- The size Ramsey number of short subdivisions of bounded degree graphs
- The minimum degree of minimal Ramsey graphs for cliques
- List Ramsey numbers
- Multicolor list Ramsey numbers grow exponentially
- Threshold Ramsey multiplicity for odd cycles
- Codes for adversaries: between worst-case and average-case jamming
- 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 locally rainbow colourings
- Induced subgraph density. VII: The five-vertex path
- Bounds for rainbow-uncommon graphs
- A note on induced Ramsey numbers
- Long induced paths in expanders
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- Pure Pairs. IX. Transversal Trees
- Recent developments on unavoidable patterns in 2-colorings of the complete graph
- Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
- scientific article; zbMATH DE number 1943978 (Why is no real title available?)
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)
