Sign up or sign in

Contributed Papers

Contributed Paper Session II-6 #2

Subevent of Contributed Paper Session II-6

Phillips 220

Eastern Time (US & Canada)

Starts at: 2025-03-01 10:20AM

Ends at: 2025-03-01 10:35AM

Counting Spanning Forests

Daniel Pragel ⟨dpragel@ggc.edu⟩

Abstract:

A spanning forest of a graph G is an acyclic spanning subgraph of G. When a spanning forest has a single connected component, it is referred to as a spanning tree. A well known theorem from Kirchhoff uses the Laplacian Matrix of G to count the number of spanning trees of G. We extend this method to spanning forests.

Notes:

This talk is based on work completed with J.C. Price and Daniel Pinzon of Georgia Gwinnett College.

Back to events