wu :: forums - Print Page


    
      
        wu :: forums
        (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
      

        riddles >> medium >> Packed Paths in a Graph
        
(Message started by: Michael Dagg on Nov 11^th, 2011, 8:13am)

Title: Packed Paths in a Graph
Post by Michael Dagg on Nov 11^th, 2011, 8:13am

Let P_i be the path on i vertices.

Show that E( K_n ), n >=2, can be decomposed into P_2, P_3, ... , P_n .

That is, that these paths can be "packed" into K_n in an edge-disjoint manner.