Irredundant and Mixed Ramsey Numbers

ECU Author/Contributor (non-ECU co-authors, if there are any, appear on document)
Ann Wells Clifton (Creator)
Institution
East Carolina University (ECU )
Web Site: http://www.ecu.edu/lib/
Advisor
Johannes H. Hattingh

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. 

Additional Information

Publication
Thesis
Date: 2013
Keywords
Mathematics, Irredundant, Mixed
Subjects
Ramsey numbers.

Email this document to

This item references:

TitleLocation & LinkType of Relationship
Irredundant and Mixed Ramsey Numbershttp://hdl.handle.net/10342/4073The described resource references, cites, or otherwise points to the related resource.