Xia Jin

Abstract

Ramsey theory studies the existence of highly regular patterns in large sets of objects. Given two graphs G and H, the Ramsey number R(G, H) is defined to be the smallest integer n such that any graph F with n or more vertices must contain G, or F must contain H. Albeit beautiful, the problem of determining Ramsey numbers is considered to be very difficult. We focus our attention on efficient algorithms for determining Ram sey numbers involving a triangle: R(K3 , G). With the help of theoretical tools, the search space is reduced by using different pruning techniques and linear programming. Efficient operations are also carried out to mathematically "glue" together small graphs to construct larger critical graphs. Using the algorithms developed in this thesis, we compute all the Ramsey numbers R(Kz,G), where G is any connected graph of order seven. Most of the corresponding critical graphs are also constructed. We believe that the algorithms developed here will have wider applications to other Ramsey-type problems.

Library of Congress Subject Headings

Ramsey numbers; Ramsey theory

Publication Date

1993

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Radziszowski, Stanislaw

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA166.J56 1993

Campus

RIT – Main Campus

Download

Share

COinS