Back to search

University of Waterloo

Induced Binary Submatroids

Abstract

dc:description.abstract

The notion of induced subgraphs is extensively studied in graph theory. An example is the famous Gy\'{a}rf\'{a}s-Sumner conjecture, which asserts that given a tree $T$ and a clique $K$, there exists a constant $c$ such that the graphs that omit both $T$ and $K$ as induced subgraphs have chromatic number at most $c$. This thesis aims to prove natural matroidal analogues of such graph-theoretic problems.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nomoto, Kazuhiro
Advisor dc:contributor.advisor
  • Nelson, Peter

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/17154

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Nomoto, Kazuhiro. Induced Binary Submatroids. University of Waterloo, 2021. http://hdl.handle.net/10012/17154