Recent developments in graph Ramsey theory
From MaRDI portal
Publication:3179072
DOI10.1017/CBO9781316106853.003zbMath1352.05123arXiv1501.02474OpenAlexW2962706453MaRDI QIDQ3179072
David Conlon, Jacob Fox, Benjamin 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
Related Items (77)
On 1-subdivisions of transitive tournaments ⋮ A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ On ordered Ramsey numbers of bounded-degree graphs ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ Unnamed Item ⋮ Strong Ramsey games: drawing on an infinite board ⋮ Ramsey numbers of uniform loose paths and cycles ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Degree Ramsey numbers for even cycles ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ On a Question of Erdös and Faudree on the Size Ramsey Numbers ⋮ 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 ⋮ Distinct degrees and homogeneous sets ⋮ 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 ⋮ The Ramsey number for a forest versus disjoint union of complete graphs ⋮ Pure Pairs. IX. Transversal Trees ⋮ Graphs of large chromatic number ⋮ Ramsey numbers with prescribed rate of growth ⋮ The multicolour size-Ramsey number of powers of paths ⋮ A Note on Induced Ramsey Numbers ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Fundamental limits of exact support recovery in high dimensions ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Finding unavoidable colorful patterns in multicolored graphs ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ The Boolean rainbow Ramsey number of antichains, Boolean posets and chains ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Distinct degrees in induced subgraphs ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ A note on equitable Hamiltonian cycles ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Ramsey numbers of ordered graphs ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ Non-monochromatic triangles in a 2-edge-coloured graph ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs ⋮ 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 ⋮ Saturation numbers for Ramsey-minimal graphs ⋮ A note on restricted online Ramsey numbers of matchings ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Short proofs of some extremal results III ⋮ On edge‐ordered Ramsey numbers ⋮ On the Size-Ramsey Number of Cycles ⋮ On Ramsey numbers of hedgehogs ⋮ The Ramsey number of Fano plane versus tight path ⋮ The Ramsey number of 3-uniform loose path versus star ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ Tower-type bounds for unavoidable patterns in words ⋮ Multicolour bipartite Ramsey number of paths ⋮ Threshold Ramsey multiplicity for paths and even cycles ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ 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 Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs ⋮ Ramsey numbers of cycles versus general graphs
This page was built for publication: Recent developments in graph Ramsey theory
