Recent developments in graph Ramsey theory

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

Authors David Conlon, Jacob Fox, Benny Sudakov 

Publication date 20 December 2016

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

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

Mathematics Subject Classification ID

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

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.

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; zbMATH DE number 66615

Cited in

(only showing first 100 items - show all)

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

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)