Ramsey Numbers and Two-colorings ofComplete Graphs
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Ramsey theory has to do with order within disorder. This thesis studies two Ramsey numbers, R(3; 3) and R(3; 4), to see if they can provide insight into finding larger Ramsey numbers. The numbers are studied with the help of computer programs. In the second part of the thesis we try to create a coloring of K45 which lacks monochromatic K5 and where each vertex has an equal degree for both color of edges. The results from studying R(3; 3) and R(3; 4) fail to give any further insight into larger Ramsey numbers. Every coloring of K45 we produce contains a monochromatic K5.
Place, publisher, year, edition, pages
2015. , 34 p.
Ramsey, Ramsey numbers, complete graph
IdentifiersURN: urn:nbn:se:lnu:diva-44610OAI: oai:DiVA.org:lnu-44610DiVA: diva2:822381
Applied Mahtematics Programme, 180 credits
Svensson, Per Anders