MATH Seminar

Title: Edge Partitions of Graphs by Trees
Seminar: Combinatorics
Speaker: Grant Zhang of University of Alabama Huntsville
Contact: Ron Gould, rg@mathcs.emory.edu
Date: 2010-04-23 at 4:00PM
Venue: W302
Download Flyer
Abstract: Let tp(G) denote the minimum number of subsets into which the edge set of a graph G can be partitioned so that each subset induces a tree. For a connected graph G of order n, it is known that tp(G) <= (n+1)/2. The clique number of a graph G is the maximum t such that G contains a complete subgraph of order t. In this talk we consider the problem of determining tp(G) for a connected graph G of order n and clique number t.