𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Ramsey number for hypergraph cycles I

✍ Scribed by P.E. Haxell; T. Łuczak; Y. Peng; V. Rödl; A. Ruciński; M. Simonovits; J. Skokan

Book ID
108167148
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
237 KB
Volume
113
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 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)

New Lower Bounds for Ramsey Numbers of G
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,

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