𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for Ramsey numbers of with a small subgraph removed

✍ Scribed by Ye Wang; Yusheng Li

Book ID
116401267
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
303 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound for irredundant Ramsey num
A lower bound for irredundant Ramsey numbers
✍ Michael Krivelevich πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 348 KB

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yiel

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,

A survey of bounds for classical Ramsey
A survey of bounds for classical Ramsey numbers
✍ F. R. K. Chung; C. M. Grinstead πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 546 KB

## Abstract This paper is a survey of the methods used for determining exact values and bounds for the classical Ramsey numbers in the case that the sets being colored are two‐element sets. Results concerning the asymptotic behavior of the Ramsey functions __R__(__k,l__) and __R~m~__(__k__) are als