Tripartite Ramsey numbers for paths
From MaRDI portal
Publication:3445510
DOI10.1002/jgt.20231zbMath1122.05065OpenAlexW4250210862MaRDI QIDQ3445510
András Gyárfás, Gábor N. Sárközy, Miklós Ruszinkó
Publication date: 11 June 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20231
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)
Related Items (22)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ On three-color Ramsey number of paths ⋮ An improvement on Łuczak's connected matchings method ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Some Ramsey-Turán type problems and related questions ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Bipartite Ramsey numbers of paths for random graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ A multipartite Ramsey number for odd cycles ⋮ Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ The tripartite Ramsey number for trees ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs ⋮ Ramsey numbers for bipartite graphs with small bandwidth
Cites Work
This page was built for publication: Tripartite Ramsey numbers for paths
