In this project, we studied the Firefighters on Graphs problem. Given a graph G, a fire breaks out at time t = 0. At every subsequent turn, certain vertices are protected, and the fire spreads to all unprotected vertices adjacent to a burning vertex. 

Our team studied this problem on the infinite hexagonal grid, where it is conjectured that a single firefighter every turn is insufficient to contain the fire. We found that the fire can be contained on the hexagonal grid using a single additional firefighter on some turn. We also studied the problem on other graphs, and discovered results that apply on certain forests composed of infinite trees.