Firefighting on Random Rooted Trees

This thesis is on the firefighting game on unlabeled rooted trees. We analyzed the average case performance of the greedy algorithm on unlabeled rooted trees. We contribute a counting formula which finds the number of trees with size n and m nodes burning for m=1 and m=2. We give the results of several experiments.