ETD PDF
Vertex-Disjoint Large Cycles
Citation
Decock, Doug Joseph. (2020-05). Vertex-Disjoint Large Cycles. Theses and Dissertations Collection, University of Idaho Library Digital Collections. https://www.lib.uidaho.edu/digital/etd/items/decock_idaho_0089e_11840.html
- Title:
- Vertex-Disjoint Large Cycles
- Author:
- Decock, Doug Joseph
- ORCID:
- 0000-0002-5366-1836
- Date:
- 2020-05
- Program:
- Mathematics
- Subject Category:
- African studies
- Abstract:
-
In this dissertation, we discuss cycles of length at least six. We prove that (Theorem 1) if $G$ is a graph of order $n\geq 6k+1$ and the minimum degree of $G$ is at least $\displaystyle\frac{7k}{2}$, then $G$ contains $k$ disjoint cycles of length at least six, and (Theorem 2) if $G$ is a graph of order $n\geq 6k+6$ and the minimum degree of $G$ is at least $\displaystyle\frac{n}{2}$, then $G$ contains $k$ disjoint cycles covering all the vertices of $G$ such that $k-1$ are 6-cycles.
- Description:
- doctoral, Ph.D., Mathematics -- University of Idaho - College of Graduate Studies, 2020-05
- Major Professor:
- Wang, Hong
- Committee:
- Datta, Somantika; Tohaneanu, Stefan; Woo, Alex
- Defense Date:
- 2020-05
- Identifier:
- Decock_idaho_0089E_11840
- Type:
- Text
- Format Original:
- Format:
- application/pdf
Rights
- Rights:
- In Copyright - Educational Use Permitted. For more information, please contact University of Idaho Library Special Collections and Archives Department at libspec@uidaho.edu.
- Standardized Rights:
- http://rightsstatements.org/vocab/InC-EDU/1.0/