On some Ramsey and Turán-type numbers for paths and cycles
Summary: For given graphs \(G_{1}, G_{2}, \dots , G_{k}\), where \(k \geq 2\), the multicolor Ramsey number \(R(G_{1}, G_{2}, \dots , G_{k})\) is the smallest integer \(n\) such that if we arbitrarily color the edges of the complete graph on \(n\) vertices with \(k\) colors, there is always a monochromatic copy of \(G_{i}\) colored with \(i\), for some \(1 \leq i \leq k\). Let \(P_k\) (resp. \(C_k\)) be the path (resp. cycle) on \(k\) vertices. In the paper we show that \(R(P_3,C_k,C_k)=R(C_k,C_k)=2k-1\) for odd \(k\). In addition, we provide the exact values for Ramsey numbers \(R(P_{4}, P_{4}, C_{k})=k+2\) and \(R(P_{3}, P_{5}, C_{k})=k+1\).
- scientific article; zbMATH DE number 4162920
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- On the Ramsey-Turán numbers of graphs and hypergraphs
- scientific article; zbMATH DE number 398964
- On the multi-colored Ramsey numbers of paths and even cycles
- On several variations of the turan and ramsey numbers
- On a Ramsey-Turán type problem
- Gallai-Ramsey numbers for cycles
- On Ramsey numbers for paths versus wheels
- Some Ramsey-Turán type results for hypergraphs
- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- On some three color Ramsey numbers for paths and cycles
- Turán numbers for odd wheels
- On some three color Ramsey numbers for paths, cycles, stripes and stars
- On the Turán number of theta graphs
- Threshold Ramsey multiplicity for paths and even cycles
- Ramsey-type results for path covers and path partitions
- A unique characterization of spectral extrema for friendship graphs
- The Turán number of directed paths and oriented cycles
- Ramsey number of a path and C_n^k
- Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
- scientific article; zbMATH DE number 4162920 (Why is no real title available?)
- Multicolor Ramsey numbers for some paths and cycles
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Threshold Ramsey multiplicity for odd cycles
- Multicolor Ramsey Numbers for Paths and Cycles
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On three-color Ramsey number of paths
This page was built for publication: On some Ramsey and Turán-type numbers for paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500974)
