𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local Ramsey numbers for copies of cycles

✍ Scribed by Halina Bielak

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
485 KB
Volume
276
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the 2-local Ramsey number

πŸ“œ SIMILAR VOLUMES

Multipartite Ramsey numbers for odd cycl
Multipartite Ramsey numbers for odd cycles
✍ AndrΓ‘s GyΓ‘rfΓ‘s; GΓ‘bor N. SΓ‘rkΓΆzy; Richard H. Schelp πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 119 KB

## Abstract In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let __n__β‰₯5 be an arbitrary positive odd integer; then, in any two‐coloring of the edges of the complete 5‐partite graph __K__((__n__βˆ’1)/2, (__n__βˆ’1)/2, (__n__βˆ’1)/2, (__n__βˆ’1)/2, 1)

Ramsey numbers for local colorings
Ramsey numbers for local colorings
✍ A. GyΓ‘rfΓ‘s; J. Lehel; R. H. Schelp; ZS. Tuza πŸ“‚ Article πŸ“… 1987 πŸ› Springer Japan 🌐 English βš– 759 KB
Bipartite anti-Ramsey numbers of cycles
Bipartite anti-Ramsey numbers of cycles
✍ Maria Axenovich; Tao Jiang; AndrΓ© KΓΌndgen πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 265 KB

## Abstract We determine the maximum number of colors in a coloring of the edges of __K~m,n~__ such that every cycle of length 2__k__ contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers __q__

The Ramsey numbers for disjoint unions o
The Ramsey numbers for disjoint unions of cycles
✍ Tristan Denley πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting