Date of Award:

8-2022

Document Type:

Thesis

Degree Name:

Master of Science (MS)

Department:

Mathematics and Statistics

Committee Chair(s)

David Brown

Committee

David Brown

Committee

Matthew Young

Committee

Zhaohu Nie

Abstract

In this paper, we explore some of the methods that are often used to solve combinatorial problems by proving Cayley’s theorem on trees in multiple ways. The intended audience of this paper is undergraduate and graduate mathematics students with little to no experience in combinatorics. This paper could also be used as a supplementary text for an undergraduate combinatorics course.

Checksum

e030c6f62ac18bd0b8b70796c22003fb

Share

COinS