Irredundant and mixed Ramsey numbers / by Ann Wells Clifton.

Author/creator Clifton, Ann Wells
Other author Hattingh, Johannes H.
Other author East Carolina University. Department of Mathematics.
Format Theses and dissertations
Publication Info[Greenville, N.C.] : East Carolina University, 2013.
Description63 pages : illustrations, digital, PDF file
Supplemental ContentAccess via ScholarShip
Subjects

Summary 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.
General notePresented to the faculty of the Department of Mathematics.
General noteAdvisor: Johannes Hattingh.
General noteTitle from PDF t.p. (viewed Jan. 31, 2013).
Dissertation noteM.A. East Carolina University 2013.
Bibliography noteIncludes bibliographical references.
Technical detailsSystem requirements: Adobe Reader.
Technical detailsMode of access: World Wide Web.

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available