wu :: forums « wu :: forums - Packed Paths in a Graph » Welcome, Guest. Please Login or Register. Nov 28th, 2024, 9:30am

RIDDLES SITE WRITE MATH! Home Help Search Members Login Register

wu :: forums    riddles    medium (Moderators: towr, SMQ, Grimbal, ThudnBlunder, Icarus, william wu, Eigenray)    Packed Paths in a Graph « Previous topic | Next topic » Pages: 1  Reply Notify of replies Send Topic Print    Author  Topic: Packed Paths in a Graph  (Read 688 times) Michael Dagg Senior Riddler     Gender: Posts: 500 Packed Paths in a Graph   « on: Nov 11th, 2011, 8:13am » Quote Modify 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. IP Logged Regards, Michael Dagg Pages: 1  Reply Notify of replies Send Topic Print Forum Jump: ----------------------------- riddles -----------------------------  - easy => medium   - hard   - what am i   - what happened   - microsoft   - cs   - putnam exam (pure math)   - suggestions, help, and FAQ   - general problem-solving / chatting / whatever ----------------------------- general -----------------------------  - guestbook   - truth   - complex analysis   - wanted   - psychology   - chinese « Previous topic | Next topic »

Powered by YaBB 1 Gold - SP 1.4!
Forum software copyright © 2000-2004 Yet another Bulletin Board