✦ LIBER ✦

Coloring number and on-line Ramsey theory for graphs and hypergraphs

✍ Scribed by H. A. Kierstead; Goran Konjevod

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 479 KB
Volume: 29
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-009-2264-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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,

Generalized ramsey theory for graphs VII

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks

✍ F. Harary; A. J. Schwenk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

Extremal theory and bipartite graph-tree

Extremal theory and bipartite graph-tree Ramsey numbers

✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II

On splittable colorings of graphs and hy

On splittable colorings of graphs and hypergraphs

✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

The ramsey numbers for stripes and one c

The ramsey numbers for stripes and one complete graph

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =

Local and meank-Ramsey numbers for compl

Local and meank-Ramsey numbers for complete graphs

✍ Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 2 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.