✦ LIBER ✦

More star sub-ramsey numbers

✍ Scribed by Geňa Hahn

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 841 KB
Volume: 34
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90060-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path-Star Ramsey numbers

✍ T.D Parsons 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Size Ramsey numbers involving stars

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 302 KB

We calculate some size Ramsey numbers involving stars. For example we prove that for t ~ k w2 ~md n sufficiently large the size Ramsey number r,, (K,,k All graphs in this paper are finite, simple and undirected. Let F, C and H be graphs. The number of vertices and edges of a graph F will be denoted

A result on C4-star Ramsey numbers

✍ Guantao Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 140 KB

In this paper, we will show that the Ramsey number r(C4,Ki,n+l)<~r(C4,Ki,n)+ 2 for all positive integers n. This result answers a question proposed by Burr, Erd6s, Faudree, Rousseau, and Schelp.

On zero-sum Ramsey numbers— stars

✍ Yair Caro 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Caro, Y., On zero-sum Ramsey numbers--stars, Discrete Mathematics 104 (1992) l-6. Let n 3 k 2 2 be positive integers, k ( n. Let H, be the cyclic group of order k. Denote by R(K,,,> Z,) the minimal integer t such that for every &-coloring of the edges of K,, (i.e., a function c : E(K,)+ hk), there i

Path and cycle sub-ramsey numbers and an

Path and cycle sub-ramsey numbers and an edge-colouring conjecture

✍ Geňa Hahn; Carsten Thomassen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We show the existence of a constant c such that if n >I ck 3 and the edges of K,, are coloured using no colour more than k times then there is a Hamilton path with all edges of distinct colours. From this we infer that sr(Pn, k) = sr(Cn, k) = n, whenever n >t ck 3. We follow for notation and termi

Planar Ramsey Numbers

✍ R. Steinberg; C.A. Tovey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The planar Ramsey number \(P R(k, l)(k, l \geqslant 2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains either a complete graph on \(k\) vertices or an independent set of size \(l\). We find exact values of \(P R(k, l)\) for all \(k\) and \(l\). Included is a pro