UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Clique minors in dense matroids

Thumbnail Image

Files

RiveraOmana_Fernanda.pdf (339.05 KB)

Date

2022-09-23

Authors

Rivera Omana, Fernanda

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

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.

Description

Keywords

matroid, clique minors, graph theory

LC Keywords

Citation

URI

http://hdl.handle.net/10012/18783

Collections

Theses
Combinatorics and Optimization