Loading...
Please wait, while we are loading the content...
Similar Documents
On some Ramsey and Turán-type numbers for paths and cycles
| Content Provider | CiteSeerX |
|---|---|
| Author | Dzido, Tomasz Kubale, Marek Piwakowski, Konrad |
| Abstract | For given graphs G1,G2,..., Gk, wherek ≥ 2, the multicolor Ramsey number R(G1,G2,..., Gk) 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 Gi colored with i, forsome1 ≤ i ≤ k. Let Pk (resp. Ck) be the path (resp. cycle) on k vertices. In the paper we show that R(P3,Ck,Ck) =R(Ck,Ck) = 2k − 1foroddk. In addition, we provide the exact values for Ramsey numbers R(P4,P4,Ck) =k +2andR(P3,P5,Ck) =k +1. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Tur N-type Number Complete Graph Multicolor Ramsey Number Monochromatic Copy Exact Value Ramsey Number Graph G1 |
| Content Type | Text |
