| dc.contributor.author | Nomoto, Kazuhiro | |
| dc.date.accessioned | 2021-07-21 14:08:19 (GMT) | |
| dc.date.available | 2021-07-21 14:08:19 (GMT) | |
| dc.date.issued | 2021-07-21 | |
| dc.date.submitted | 2021-07-16 | |
| dc.identifier.uri | http://hdl.handle.net/10012/17154 | |
| dc.description.abstract | The notion of induced subgraphs is extensively studied in graph theory. An example is the famous Gy\'{a}rf\'{a}s-Sumner conjecture, which asserts that given a tree $T$ and a clique $K$, there exists a constant $c$ such that the graphs that omit both $T$ and $K$ as induced subgraphs have chromatic number at most $c$. This thesis aims to prove natural matroidal analogues of such graph-theoretic problems. | en |
| dc.language.iso | en | en |
| dc.publisher | University of Waterloo | en |
| dc.title | Induced Binary Submatroids | en |
| dc.type | Doctoral Thesis | en |
| dc.pending | false | |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.degree | Doctor of Philosophy | en |
| uws-etd.embargo.terms | 0 | en |
| uws.contributor.advisor | Nelson, Peter | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
