Clique minors in dense matroids
| dc.contributor.author | Rivera Omana, Fernanda | |
| dc.date.accessioned | 2022-09-23T14:57:22Z | |
| dc.date.available | 2022-09-23T14:57:22Z | |
| dc.date.issued | 2022-09-23 | |
| dc.date.submitted | 2022-09-16 | |
| dc.description.abstract | The objective of this thesis is to bound the number of points a $U_{2,\ell+2}$- and $M(K_{k+1})$-minor-free matroid has. We first prove that a sufficiently large matroid will contain a structure called a tower. We then use towers to find a complete minor in a matroid with no $U_{2,\ell+2}$-minor. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/18783 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | matroid | en |
| dc.subject | clique minors | en |
| dc.subject | graph theory | en |
| dc.title | Clique minors in dense matroids | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| 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.embargo.terms | 0 | en |
| uws.contributor.advisor | Nelson, Peter | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |