Publication Date


First Advisor

Michael Santana


In 1963, Corradi and Hajnal proved that for any positive integer k if a graph contains at least 3k vertices and has minimum degree at least 2k, then it contains k disjoint cycles. This result is sharp, meaning there are graphs on at least 3k vertices with a minimum degree of 2k-1 that do not contain k disjoint cycles. Their work is the motivation behind finding sharp conditions that guarantee the existence of specific structures, e.g. cycles, chorded cycles, theta graphs, etc. In this talk, we will explore minimum degree conditions which guarantee a specific number of doubly chorded cycles, graphs that contain a spanning cycle and at least two additional edges, called chords. In particular, we will discuss our findings on these conditions and how it fits in with previous results in this area.

Included in

Mathematics Commons