Irredundant and Mixed Ramsey Numbers
Abstract
The irredundant Ramsey number, s(m,n), is the smallest p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B), either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n-element irredundant set. The mixed irredundant Ramsey number, t(m,n), is the smallest number p such that in every two-coloring of the edges of K[subscript]p using colors red (R) and blue (B), either the blue subgraph contains an m-element irredundant set or the red subgraph contains an n-element independent set. This thesis provides all known results for irredundant and mixed Ramsey numbers.
Subject
Date
2013
Citation:
APA:
Clifton, Ann Wells.
(January 2013).
Irredundant and Mixed Ramsey Numbers
(Master's Thesis, East Carolina University). Retrieved from the Scholarship.
(http://hdl.handle.net/10342/4073.)
Collections
Publisher
East Carolina University