Thesis (Ph. D.)--Carleton University, 1989. / Also available in electronic format on the Internet.

Thesis (M.S.)--Rochester Institute of Technology, 1992. / Typescript. Includes bibliographical references (leaves 36-37).

Thesis (M.S.)--Rochester Institute of Technology, 1993. / Typescript. Includes bibliographical references (leaves 35-38).

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.

<p> This thesis gives new finite and asymptotic estimates of the Ramsey numbers using certain number-theoretical considerations; it also contains a brief historical survey on determination of Ramsey numbers and related number-theoretical problems.</p> / Thesis / Master of Science (MSc)

Ramsey Theorem, in the most simple form, states that if we are given a positive integer l, there exists a minimal integer r(l), called the Ramsey number, such any partition of the edges of K_r(l) into two sets, i.e. a 2-coloring, yields a copy of K_l contained entirely in one of the partitioned sets, i.e. a monochromatic copy of Kl. We prove an extension of Ramsey's Theorem, in the more general form, by replacing complete graphs by multipartite graphs in both senses, as the partitioned set and as the desired monochromatic graph. More formally, given integers l and k, there exists an integer p(m) such that any 2-coloring of the edges of the complete multipartite graph K_p(m);r(k) yields a monochromatic copy of K_m;k . The tools that are used to prove this result are the Szemeredi Regularity Lemma and the Blow Up Lemma. A full proof of the Regularity Lemma is given. The Blow-Up Lemma is merely stated, but other graph embedding results are given. It is also shown that certain embedding conditions on classes of graphs, namely (f , ?) -embeddability, provides a method to bound the order of the multipartite Ramsey numbers on the graphs. This provides a method to prove that a large class of graphs, including trees, graphs of bounded degree, and planar graphs, has a linear bound, in terms of the number of vertices, on the multipartite Ramsey number.

No description available.

Thesis (M.S.)--Rochester Institute of Technology, 2004. / Typescript. Includes bibliographical references (leaves 71-75).

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / O propÃsito desta dissertaÃÃo à apresentar aplicaÃÃes da Teoria dos Grafos à Teoria dos Grupos. De posse do grafo associado a um grupo finito, nÃs obtemos vÃrios resultados interessantes sobre a estrutura do grupo analisando tal grafo à luz de tÃcnicas-padrÃo da Teoria dos Grafos. Mais precisamente, os nÃmeros cromÃtico e de independÃncia do grafo de um grupo finito nos permitem estimar a cardinalidade mÃxima de um subgrupo abeliano do mesmo, bem como o tamanho mÃnimo possÃvel de um subconjunto do grupo formado por elementos que nÃo comutam dois a dois; no caso de grupos finitos abelianos, nÃs tambÃm estudamos seus subconjuntos livres de somas. / This report deals with applications of Graph Theory to Group Theory. Once we construct the graph associated to a finite group, we get several interesting results on the group structure by analysing its associated graph with the help of various standard graph-theoretic tools. More precisely, the chromatic and independence numbers of the graph of a finite group allows us to estimate the maximal cardinality of an abelian subgroup of it, as well as the minimal size of a subset of the group, all of whose elements donât commute in pairs; for finite abelian groups, we also study their free-sum subsets.

No description available.