Degree Type

Creative Component

Semester of Graduation

Spring 2019

Department

Mathematics

First Major Professor

Steve Butler

Degree(s)

Master of Science (MS)

Major(s)

Mathematics

Abstract

Consider the following process on a simple graph with no isolated vertices: Randomly order the edges and remove an edge if and only if the edge is incident to two vertices already incident to some preceding edge. This process results in a spanning forest of the graph.

Recurrences are given for the process for multiple families of graphs, and the probability of obtaining $k$ components in the above process is given by a new method for the Fan graph $F_{n-2,2}$. An approach to proving a previously published conjecture is also discussed.

Copyright Owner

Joseph S. Alameda

File Format

application/pdf

Share

COinS