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.
 

Enumerating matroid extensions

Thumbnail Image

Files

RedlinHume_Shayla.pdf (944.5 KB)

Date

2023-09-01

Authors

Redlin Hume, Shayla

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis investigates the problem of enumerating the extensions of certain matroids. A matroid M is an extension of a matroid N if M delete e is equal to N for some element e of M. Similarly, a matroid M is a coextension of a matroid N if M contract e is equal to N for some element e of M. In this thesis, we consider extensions and coextensions of matroids in the classes of graphic matroids, representable matroids, and frame matroids. We develop a general strategy for counting the extensions of matroids which translates the problem into counting stable sets in an auxiliary graph. We apply this strategy to obtain asymptotic results on the number of extensions and coextensions of certain graphic matroids, projective geometries, and Dowling geometries.

Description

Keywords

matroid, extensions, coextensions, enumeration, graphic matroids, projective geometries, Dowling geometries, container method

LC Keywords

Citation

URI

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

Collections

Theses
Combinatorics and Optimization