|
|||||
|
|
Lower bounds for lower Ramsey numbers |
|
| Authors: | Ralph Faudree Ronald J. Gould Michael S. Jacobson Linda Lesniak |
| Affiliation: | 1. Memphis State University;2. Emory University;3. University of Louisville;4. Drew University |
| 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 order p has i(G) ≤ m or μ;(G) ≤ n. In this paper we give several new lower bounds for s (m, n) as well as determine precisely the values s(1, n). |
| Keywords: | |