{"id":{"repo_id":"mississippi","oai_identifier":"oai:egrove.olemiss.edu:etd-1675"},"canonical_url":"https://search.dev.ndltd.org/etd/mississippi/oai:egrove.olemiss.edu:etd-1675","repository":{"repo_id":"mississippi","name":"University of Mississippi","base_url":"https://egrove.olemiss.edu/do/oai/"},"display":{"title":"On Binary And Regular Matroids Without Small Minors","abstract":"The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-minor results for Regular Matroids. Structural theorems on the relationship between minors and k-sums of matroids are developed here in order to provide some of these characterizations. Chapter 2 of the dissertation contains excluded-minor results for Binary Matroids. The first main result of this dissertation is a characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes results of Mayhew and Royle [18] for binary matroids and results of Dirac [8] and Lovász [15] for graphs. The results of this chapter are then extended from the class of internally 4-connected matroids to the class of 3-connected matroids. Chapter 3 of the dissertation contains the second main result, a decomposition theorem for regular matroids without certain minors. This decomposition theorem is used to obtain excluded-minor results for Regular Matroids. Wagner, Lovász, Oxley, Ding, Liu, and others have characterized many classes of graphs that are H-free for graphs H with at most twelve edges (see [7]). We extend several of these excluded-minor characterizations to regular matroids in Chapter 3. We also provide characterizations of regular matroids excluding several graphic matroids such as the octahedron, cube, and the Möbius Ladder on eight vertices. Both theoretical and computer-aided proofs of the results of Chapters 2 and 3 are provided in this dissertation.","abstract_html":"The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-minor results for Regular Matroids. Structural theorems on the relationship between minors and k-sums of matroids are developed here in order to provide some of these characterizations. Chapter 2 of the dissertation contains excluded-minor results for Binary Matroids. The first main result of this dissertation is a characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes results of Mayhew and Royle [18] for binary matroids and results of Dirac [8] and Lovász [15] for graphs. The results of this chapter are then extended from the class of internally 4-connected matroids to the class of 3-connected matroids. Chapter 3 of the dissertation contains the second main result, a decomposition theorem for regular matroids without certain minors. This decomposition theorem is used to obtain excluded-minor results for Regular Matroids. Wagner, Lovász, Oxley, Ding, Liu, and others have characterized many classes of graphs that are H-free for graphs H with at most twelve edges (see [7]). We extend several of these excluded-minor characterizations to regular matroids in Chapter 3. We also provide characterizations of regular matroids excluding several graphic matroids such as the octahedron, cube, and the Möbius Ladder on eight vertices. Both theoretical and computer-aided proofs of the results of Chapters 2 and 3 are provided in this dissertation.","abstract_has_math":false,"creators":["Harville, Kayla Davis"],"institution":null,"degree_name":"Ph.D. in Mathematics","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Haidong Wu","Dawn Wilkins","Qingying Bu"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-01-01T08:00:00Z","date_published":"2013-01-01T08:00:00Z","updated_at":"2026-07-24T03:05:53Z","subjects":["Excluded-Minors","Harville","Matroids","Minors","Prism+E","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://egrove.olemiss.edu/etd/676","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Haidong Wu","Dawn Wilkins","Qingying Bu"]},{"key":"dc:creator","label":"Author","values":["Harville, Kayla Davis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-06-20T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D. in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Excluded-Minors","Harville","Matroids","Minors","Prism+E","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://egrove.olemiss.edu/etd/676"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-minor results for Regular Matroids. Structural theorems on the relationship between minors and k-sums of matroids are developed here in order to provide some of these characterizations. Chapter 2 of the dissertation contains excluded-minor results for Binary Matroids. The first main result of this dissertation is a characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes results of Mayhew and Royle [18] for binary matroids and results of Dirac [8] and Lovász [15] for graphs. The results of this chapter are then extended from the class of internally 4-connected matroids to the class of 3-connected matroids. Chapter 3 of the dissertation contains the second main result, a decomposition theorem for regular matroids without certain minors. This decomposition theorem is used to obtain excluded-minor results for Regular Matroids. Wagner, Lovász, Oxley, Ding, Liu, and others have characterized many classes of graphs that are H-free for graphs H with at most twelve edges (see [7]). We extend several of these excluded-minor characterizations to regular matroids in Chapter 3. We also provide characterizations of regular matroids excluding several graphic matroids such as the octahedron, cube, and the Möbius Ladder on eight vertices. Both theoretical and computer-aided proofs of the results of Chapters 2 and 3 are provided in this dissertation."]},{"key":"dc:title","label":"Title","values":["On Binary And Regular Matroids Without Small Minors"]}]}],"canonical_facts":{"dc:contributor":["Haidong Wu","Dawn Wilkins","Qingying Bu"],"dc:creator":["Harville, Kayla Davis"],"dc:date.available":["2019-06-20T07:00:00Z"],"dc:description.abstract":["The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-minor results for Regular Matroids. Structural theorems on the relationship between minors and k-sums of matroids are developed here in order to provide some of these characterizations. Chapter 2 of the dissertation contains excluded-minor results for Binary Matroids. The first main result of this dissertation is a characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes results of Mayhew and Royle [18] for binary matroids and results of Dirac [8] and Lovász [15] for graphs. The results of this chapter are then extended from the class of internally 4-connected matroids to the class of 3-connected matroids. Chapter 3 of the dissertation contains the second main result, a decomposition theorem for regular matroids without certain minors. This decomposition theorem is used to obtain excluded-minor results for Regular Matroids. Wagner, Lovász, Oxley, Ding, Liu, and others have characterized many classes of graphs that are H-free for graphs H with at most twelve edges (see [7]). We extend several of these excluded-minor characterizations to regular matroids in Chapter 3. We also provide characterizations of regular matroids excluding several graphic matroids such as the octahedron, cube, and the Möbius Ladder on eight vertices. Both theoretical and computer-aided proofs of the results of Chapters 2 and 3 are provided in this dissertation."],"dc:identifier":["https://egrove.olemiss.edu/etd/676"],"dc:subject":["Excluded-Minors","Harville","Matroids","Minors","Prism+E","Mathematics"],"dc:title":["On Binary And Regular Matroids Without Small Minors"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D. in Mathematics"]},"updated_at":"2026-07-24T03:05:53Z"}