\(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
From MaRDI portal
Publication:1305528
zbMath0934.05091MaRDI QIDQ1305528
Publication date: 29 November 1999
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (51)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ New upper bound for multicolor Ramsey number of odd cycles ⋮ Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ The multicolour Ramsey number of a long odd cycle ⋮ Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ An improved bound for the monochromatic cycle partition number ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels ⋮ Stability for vertex cycle covers ⋮ On Schelp's problem for three odd long cycles ⋮ The Ramsey number for a triple of long even cycles ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ Monochromatic connected matchings in 2‐edge‐colored multipartite graphs ⋮ Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles ⋮ The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ An improvement on Łuczak's connected matchings method ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ On the restricted size Ramsey number for a pair of cycles ⋮ Bipartite Ramsey numbers of cycles ⋮ Random bipartite Ramsey numbers of long cycles ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ 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 ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ Multicolour Ramsey numbers of odd cycles ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ The tripartite Ramsey number for trees ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ The 3-colored Ramsey number of even cycles ⋮ Monochromatic cycle partitions in random graphs ⋮ Multicolour bipartite Ramsey number of paths ⋮ Large Book-Cycle Ramsey Numbers ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ Towards Lehel's conjecture for 4-uniform tight cycles ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles ⋮ The Ramsey number for hypergraph cycles. I. ⋮ Multicolour Ramsey numbers of paths and even cycles
This page was built for publication: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
