The Ramsey numbers for a triple of long cycles
From MaRDI portal
Publication:1786049
DOI10.1007/s00493-016-2433-yzbMath1424.05208arXiv0709.0048OpenAlexW3104106366MaRDI QIDQ1786049
Tomasz Łuczak, Agnieszka Figaj
Publication date: 24 September 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.0048
Related Items
On Schelp's problem for three odd long cycles, Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree, On the restricted size Ramsey number for a pair of cycles, Random bipartite Ramsey numbers of long cycles, 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, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Long monochromatic paths and cycles in 2-edge-colored multipartite graphs, Bipartite Ramsey numbers of cycles for random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ramsey number for a triple of long even cycles
- On the combinatorial problems which I would most like to see solved
- All Ramsey numbers for cycles in graphs
- Generalized Ramsey theory for multiple colors
- Three-color Ramsey numbers for paths
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On maximal paths and circuits of graphs
- Generalized and geometric Ramsey numbers for cycles.