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