Abstract
dc:description.abstractThis 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.
Degree
thesis:*- Name thesis:degree_name
- M.A. in Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematics
- Year dc:date.available
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Horne, Dixie Smith
- Contributors dc:contributor
-
- Talmadge James Reid
- Stanislaw M. Dziobiak
- Haidong Wu
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://egrove.olemiss.edu/etd/668
- OAI identifier oai:identifier
- oai:egrove.olemiss.edu:etd-1667