Document Type
Thesis - University Access Only
Award Date
2006
Degree Name
Master of Science (MS)
Department / School
Mathematics and Statistics
Abstract
For every integer c and every positive integer m ≥ 3, let n = R(m, c) be the least integer, provided that it exists, such that for every coloring [special characters omitted]there exists integers x1, x2,...,xm (not necessarily distinct) such that [special characters omitted]and [special characters omitted]If such an integer does not exist, then let R( m, c) = ∞. The main result is that for every odd integer m ≥ 3 and every positive integer c [special characters omitted]
Library of Congress Subject Headings
Combinatorial analysis
Ramsey theory
Rado numbers
Format
application/pdf
Number of Pages
40
Publisher
South Dakota State University
Recommended Citation
Mousel, Joe, "2-Color Rado Numbers for The Family of Equations x₁ + x₂ + ... xm-1 + c = (m - 1)xm" (2006). Electronic Theses and Dissertations. 1284.
https://openprairie.sdstate.edu/etd2/1284