๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lower bounds for hypergraph Ramsey numbers

โœ Scribed by H.L. Abbott; M.J. Smuga-Otto

Book ID
104183102
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
245 KB
Volume
61
Category
Article
ISSN
0166-218X

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,

Lower bounds for lower Ramsey numbers
Lower bounds for lower Ramsey numbers
โœ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 310 KB ๐Ÿ‘ 1 views

## Abstract For any graph __G__, let __i__(__G__) and ฮผ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower bounds for some Ramsey numbers
Lower bounds for some Ramsey numbers
โœ H.L Abbott; E.R Williams ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB