Title:Gallai's 1966 conjecture on path decompositions
Location: Room V129, Mathematics Building (Callaghan Campus) The University of Newcastle
Time and Date:3:00 pm, Thu, 18th Oct 2012
Abstract:
In 1966 Gallai conjectured that a connected graph of order n can be decomposed into n/2 or fewer paths when n is even, or (n+1)/2 or fewer paths when n is odd. We shall discuss old and new work on this as yet unsolved conjecture.