Irredundant and Mixed Ramsey Numbers

dc.contributor.advisor	Hattingh, Johannes H.	en_US
dc.contributor.author	Clifton, Ann Wells	en_US
dc.contributor.department	Mathematics	en_US
dc.date.accessioned	2013-01-15T12:40:57Z
dc.date.available	2013-01-15T12:40:57Z
dc.date.issued	2013	en_US
dc.description.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.	en_US
dc.description.degree	M.A.	en_US
dc.format.extent	63 p.	en_US
dc.format.medium	dissertations, academic	en_US
dc.identifier.uri	http://hdl.handle.net/10342/4073
dc.language.iso		en_US
dc.publisher	East Carolina University	en_US
dc.subject	Mathematics	en_US
dc.subject	Irredundant	en_US
dc.subject	Mixed	en_US
dc.subject.lcsh	Ramsey numbers
dc.title	Irredundant and Mixed Ramsey Numbers	en_US
dc.type	Master's Thesis	en_US

Files

Now showing 1 - 1 of 1