Three-color Ramsey numbers for paths
From MaRDI portal
Publication:2390138
DOI10.1007/S00493-007-0043-4zbMATH Open1175.05093OpenAlexW4234658150MaRDI QIDQ2390138FDOQ2390138
Authors: Miklós Ruszinkó, Gábor N. Sárközy, András Gyárfás, Endre Szemerédi 
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
Recommendations
- On some three-color Ramsey numbers for paths
- On three-color Ramsey number of paths
- On some three color Ramsey numbers for paths and cycles
- scientific article; zbMATH DE number 7071677
- On the multicolor Ramsey number for 3-paths of length three
- On some three-color Ramsey numbers
- 3-color bipartite Ramsey number of cycles and paths
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3
- scientific article; zbMATH DE number 908562
- On some three color Ramsey numbers for paths, cycles, stripes and stars
Cited In (64)
- A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
- An improvement on Łuczak's connected matchings method
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- Title not available (Why is that?)
- Random bipartite Ramsey numbers of long cycles
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths
- The first nontrivial three color upper domination in Ramsey number is 13
- Problems close to my heart
- Ramsey numbers of 3-uniform loose paths and loose cycles
- On some three-color Ramsey numbers for paths
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Multicolour bipartite Ramsey number of paths
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Ramsey numbers for degree monotone paths
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- A multipartite Ramsey number for odd cycles
- Gallai-Ramsey Number for Rainbow S3
- On some three color Ramsey numbers for paths, cycles, stripes and stars
- The 3-colored Ramsey number of even cycles
- Improved monochromatic loose cycle partitions in hypergraphs
- Matchings with few colors in colored complete graphs and hypergraphs
- Ramsey numbers for bipartite graphs with small bandwidth
- Multicolour Ramsey numbers of paths and even cycles
- Local colourings and monochromatic partitions in complete bipartite graphs
- On some multicolor Ramsey properties of random graphs
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- Title not available (Why is that?)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
- The Ramsey numbers for a triple of long cycles
- Calculating Ramsey numbers by partitioning colored graphs
- On multicolor Ramsey number of paths versus cycles
- On three-color Ramsey number of paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Bipartite Ramsey numbers of cycles for random graphs
- Diagonal Ramsey numbers of loose cycles in uniform hypergraphs
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
- Star versus two stripes Ramsey numbers and a conjecture of Schelp
- Ramsey numbers for the path with three edges
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Stability of the potential function
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- Gallai-Ramsey number of even cycles with chords
- Monochromatic square-cycle and square-path partitions
- Tripartite Ramsey numbers for paths
- Three color Ramsey numbers for graphs with at most 4 vertices
- Monochromatic partitions in local edge colorings
- Color‐biased Hamilton cycles in random graphs
- On the circumference of a graph and its complement
- Stability of the path-path Ramsey number
- Monochromatic cycle power partitions
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Generalized Ramsey numbers for paths in 2-chromatic graphs
- Corrigendum. Three-color Ramsey numbers for paths
- 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
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- Ramsey number of a connected triangle matching
This page was built for publication: Three-color Ramsey numbers for paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390138)
