Three-color Ramsey numbers for paths
From MaRDI portal
Publication:2390138
DOI10.1007/S00493-007-0043-4zbMath1175.05093OpenAlexW4234658150MaRDI QIDQ2390138
Gábor N. Sárközy, Miklós Ruszinkó, András Gyárfás
Publication date: 20 July 2009
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0043-4
Related Items (53)
On some three-color Ramsey numbers for paths ⋮ Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ⋮ Monochromatic cycle power partitions ⋮ Ramsey numbers for degree monotone paths ⋮ Corrigendum. Three-color Ramsey numbers for paths ⋮ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Ramsey numbers of 3-uniform loose paths and loose cycles ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ Problems close to my heart ⋮ On three-color Ramsey number of paths ⋮ An improvement on Łuczak's connected matchings method ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ On some three color Ramsey numbers for paths, cycles, stripes and stars ⋮ A multipartite Ramsey number for odd cycles ⋮ Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs ⋮ An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs ⋮ Stability of the Potential Function ⋮ The Ramsey numbers for a triple of long cycles ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ The 3-colored Ramsey number of even cycles ⋮ Monochromatic square-cycle and square-path partitions ⋮ Gallai-Ramsey number of even cycles with chords ⋮ Multicolour bipartite Ramsey number of paths ⋮ Stability of the path-path Ramsey number ⋮ On the circumference of a graph and its complement ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ Multicolour Ramsey numbers of paths and even cycles
This page was built for publication: Three-color Ramsey numbers for paths
