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