Thesis (MSc.)--University of Stellenbosch, 2000. / ENGLISH ABSTRACT: The notion of a classical graph theoretic Ramsey number is generalized by assuming that
both the original graph whose edges are arbitrarily bicoloured and the monochromatic
subgraphs to be forced are complete, balanced, multipartite graphs, instead of complete
graphs as in the standard definition. Some small multipartite Ramsey numbers are found,
while upper- and lower bounds are established for others. Analytic arguments as well as
computer searches are used. / AFRIKAANSE OPSOMMING: Die klassieke grafiek-teoretiese definisie van ’n Ramsey getal word veralgemeen deur te
aanvaar dat beide die oorspronklike grafiek, waarvan die lyne willekeurig met twee kleure
gekleur word en die gesogte subgrafieke almal volledige, gebalanseerde, veelledige grafieke
is, anders as in die standaard definisie. Klein veelledige Ramsey getalle word gevind,
terwyl bo- en ondergrense vir ander daargestel word. Analitiese argumente en rekenaarsoektogte
word gebruik.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:sun/oai:scholar.sun.ac.za:10019.1/51640 |
| Date | 12 1900 |
| Creators | Stipp, Eugene Heinz |
| Contributors | Van Vuuren, J. H., Stellenbosch University. Faculty of Science. Dept. of Applied Mathematics. |
| Publisher | Stellenbosch : Stellenbosch University |
| Source Sets | South African National ETD Portal |
| Language | en_ZA |
| Detected Language | English |
| Type | Thesis |
| Format | 91 p. : ill. |
| Rights | Stellenbosch University |
Page generated in 0.0022 seconds