Abstract
dc:description.abstractGiven a system of linear equations or inequalities, the least integer n, provided that it exists, such that for every t-coloring of the set { 1, 2, ... , n} there exists a monochromatic solution to the system is called the t-color Rado number for the system. If there does not exist a least integer n, then we say that the t-color Rado number for the system is infinite. The two-color Rado number of the inequality x1 + x2 + · · · + Xm-1 < xm, where xi ≠ xj when i ≠ j, has already been determined and published. In addition, the structure of the longest two-coloring that avoids a monochromatic solution to the inequality was determined. In this paper, we will present the three-color Rado number of the same inequality and also the structure of the longest three-coloring that avoids a monochromatic solution to the inequality.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - University Access Only
- Discipline thesis:degree_discipline
- Mathematics and Statistics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Johnson, Brenda
- Contributors dc:contributor
-
- Daniel Schaal
Rights
dc:rightsIdentifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd2/1098