The Ramsey numbers for a triple of long cycles
From MaRDI portal
Publication:1786049
Abstract: We find the asymptotic value of the Ramsey number for a triple of long cycles, where the lengths of the cycles are large but may have different parity.
Cites work
- All Ramsey numbers for cycles in graphs
- CN-rings.
- Generalized and geometric Ramsey numbers for cycles.
- Generalized Ramsey theory for multiple colors
- scientific article; zbMATH DE number 5158529 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On maximal paths and circuits of graphs
- On the combinatorial problems which I would most like to see solved
- Ramsey numbers for cycles in graphs
- The Ramsey number for a triple of long even cycles
- Three-color Ramsey numbers for paths
Cited in
(10)- Bipartite Ramsey numbers of cycles for random graphs
- On Schelp's problem for three odd long cycles
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- 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 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
- Multicolored Bipartite Ramsey Numbers of Large Cycles
This page was built for publication: The Ramsey numbers for a triple of long cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786049)
