Electronic Theses and Dissertations

Date of Award

2014

Document Type

Thesis

Degree Name

M.A. in Mathematics

Department

Mathematics

First Advisor

Talmadge James Reid

Second Advisor

Stanislaw M. Dziobiak

Third Advisor

Haidong Wu

Relational Format

dissertation/thesis

Abstract

This thesis considers a Ramsey Theory question for graphs and regular matroids. Specifically, how many elements N are required in a 3-connected graphic or regular matroid to force the existence of certain specified minors in that matroid? This question cannot be answered for an arbitrary collection of specified minors. However, there are results from the literature for which the number N exists for certain collections of minors. We first encode totally unimodular matrix representations of certain matroids. We use the computer program MACEK to investigate this question for certain classes of specified minors.

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.