Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Bounds for Ramsey numbers in multipartite graphs
Thesis (MSc.)--University of Stellenbosch, 2000.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | en_ZA |
| Published: |
Stellenbosch : Stellenbosch University
2012
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613882774716416 |
|---|---|
| access_status_str | Open Access |
| author | Stipp, Eugene Heinz |
| author2 | Van Vuuren, J. H. |
| author_browse | Stipp, Eugene Heinz Van Vuuren, J. H. |
| author_facet | Van Vuuren, J. H. Stipp, Eugene Heinz |
| author_sort | Stipp, Eugene Heinz |
| collection | Thesis |
| dc_rights_str_mv | Stellenbosch University |
| description | Thesis (MSc.)--University of Stellenbosch, 2000. |
| format | Thesis |
| id | oai:scholar.sun.ac.za:10019.1/51640 |
| institution | Stellenbosch University (South Africa) |
| language | en_ZA |
| last_indexed | 2026-06-10T12:43:12.690Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository |
| publishDate | 2012 |
| publishDateRange | 2012 |
| publishDateSort | 2012 |
| publisher | Stellenbosch : Stellenbosch University |
| publisherStr | Stellenbosch : Stellenbosch University |
| record_format | dspace |
| source_str | SUNScholar — Stellenbosch University Repository |
| spelling | oai:scholar.sun.ac.za:10019.1/51640 Bounds for Ramsey numbers in multipartite graphs Stipp, Eugene Heinz Van Vuuren, J. H. Stellenbosch University. Faculty of Science. Dept. of Applied Mathematics. Ramsey theory Graph theory Dissertations -- Applied mathematics Theses -- Applied mathematics Dissertations -- Mathematical sciences Theses -- Mathematical sciences 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. 2012-08-27T11:34:36Z 2012-08-27T11:34:36Z 2000-12 Thesis http://hdl.handle.net/10019.1/51640 en_ZA Stellenbosch University 91 p. : ill. application/pdf Stellenbosch : Stellenbosch University |
| spellingShingle | Ramsey theory Graph theory Dissertations -- Applied mathematics Theses -- Applied mathematics Dissertations -- Mathematical sciences Theses -- Mathematical sciences Stipp, Eugene Heinz Bounds for Ramsey numbers in multipartite graphs |
| title | Bounds for Ramsey numbers in multipartite graphs |
| title_full | Bounds for Ramsey numbers in multipartite graphs |
| title_fullStr | Bounds for Ramsey numbers in multipartite graphs |
| title_full_unstemmed | Bounds for Ramsey numbers in multipartite graphs |
| title_short | Bounds for Ramsey numbers in multipartite graphs |
| title_sort | bounds for ramsey numbers in multipartite graphs |
| topic | Ramsey theory Graph theory Dissertations -- Applied mathematics Theses -- Applied mathematics Dissertations -- Mathematical sciences Theses -- Mathematical sciences |
| url | http://hdl.handle.net/10019.1/51640 |
| work_keys_str_mv | AT stippeugeneheinz boundsforramseynumbersinmultipartitegraphs |