The following pages link to \(R(C_n,C_n,C_n)\leqq (4+o(1))n\) (Q1305528):
Displaying 46 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- The multicolour Ramsey number of a long odd cycle (Q322271) (← links)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles (Q668084) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- The Ramsey number for hypergraph cycles. I. (Q817613) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- The Ramsey number for a triple of long even cycles (Q885294) (← links)
- The 3-colored Ramsey number of even cycles (Q1026011) (← links)
- New upper bound for multicolor Ramsey number of odd cycles (Q1618240) (← links)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- Multicolour Ramsey numbers of odd cycles (Q1989952) (← links)
- Bipartite Ramsey numbers of cycles for random graphs (Q2053731) (← links)
- Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels (Q2166308) (← links)
- On Schelp's problem for three odd long cycles (Q2173424) (← links)
- Long monochromatic paths and cycles in 2-colored bipartite graphs (Q2185910) (← links)
- Exact Ramsey numbers of odd cycles via nonlinear optimisation (Q2214084) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Multicolour bipartite Ramsey number of paths (Q2325761) (← links)
- Ramsey numbers for bipartite graphs with small bandwidth (Q2346589) (← links)
- Multicolour Ramsey numbers of paths and even cycles (Q2357225) (← links)
- Stability for vertex cycle covers (Q2401441) (← links)
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth (Q2701404) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth (Q4611005) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree (Q6057663) (← links)
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (Q6081557) (← links)
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths (Q6094047) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- Turán‐type problems for long cycles in random and pseudo‐random graphs (Q6176470) (← links)
- On the restricted size Ramsey number for a pair of cycles (Q6197749) (← links)
- Bipartite Ramsey numbers of cycles (Q6201898) (← links)
- Random bipartite Ramsey numbers of long cycles (Q6202936) (← links)
- Multicolored Bipartite Ramsey Numbers of Large Cycles (Q6489811) (← links)
