Citation
Wilkinson, John Fergas (1965) A Coloring Problem Related to König's Theorem. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/N6B0-QM91. https://resolver.caltech.edu/CaltechETD:etd-01222004-114035
Abstract
A connection is shown between Konig's Theorem on 0-1 matrices and theorems giving sufficient conditions, in terms of certain forbidden subgraphs, for a graph G to have chromatic number equal to the maximum number of vertices in any clique of G. A conjecture is proposed which would, if true, give the best possible such theorem. Three special cases of this conjecture are proved, and Konig's Theorem is shown to be an easy corollary of any one of them.
| Item Type: | Thesis (Dissertation (Ph.D.)) |
|---|---|
| Subject Keywords: | (Mathematics and Economics) |
| Degree Grantor: | California Institute of Technology |
| Division: | Physics, Mathematics and Astronomy |
| Major Option: | Mathematics |
| Minor Option: | Economics |
| Thesis Availability: | Public (worldwide access) |
| Research Advisor(s): |
|
| Thesis Committee: |
|
| Defense Date: | 1 April 1965 |
| Record Number: | CaltechETD:etd-01222004-114035 |
| Persistent URL: | https://resolver.caltech.edu/CaltechETD:etd-01222004-114035 |
| DOI: | 10.7907/N6B0-QM91 |
| Default Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 271 |
| Collection: | CaltechTHESIS |
| Deposited By: | Imported from ETD-db |
| Deposited On: | 28 Jan 2004 |
| Last Modified: | 10 Feb 2024 00:05 |
Thesis Files
![[img]](https://thesis.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF (Wilkinson_jf_1965.pdf)
- Final Version
See Usage Policy. 1MB |
Repository Staff Only: item control page
