Back to search

CSUniversity San Bernardino

Comparing 3-Connectedness and Roundness in Matroid Theory

Abstract

dc:description.abstract

A matroid is a discrete mathematical object that abstracts and connects the various notions of independence found throughout mathematics. Such notions of independence include linear independence, algebraic independence, as well as notions of independence that arise in graph theory. There are many broad classes of matroids. Important examples include binary matroids, graphic matroids, regular matroids, uniform matroids, and various levels of connected matroids. Some of the most important problems in matroid theory involve characterizing classes of matroids so that such characterizations can be used to prove results concerning these matroid classes. This thesis is a study of two important classes of matroids: round matroids and 3-connected matroids. Matroids that are 3-connected cannot be easily decomposed into smaller components, while round matroids are one way to generalize complete graphs in graph theory. In this thesis, we study the relationship between 3-connectedness and roundness in matroid theory.

Degree

thesis:*
Name thesis:degree_name
Master of Arts in Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Larios, Blanca Delia
Contributors dc:contributor
  • Aikin, Jeremy

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd/2519

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Larios, Blanca Delia. Comparing 3-Connectedness and Roundness in Matroid Theory. Thesis thesis, https://scholarworks.lib.csusb.edu/etd/2519