Prove that a graph where all the vertices have degree 5 cannot be composed into all isomorphic paths of length 6

Question

Prove that a graph where all the vertices have degree 5 cannot be composed into  all isomorphic paths of length 6

dan815 · Answer

@hwyl

dan815 · Answer

@oldrin.bataku any ideas, my teacher said, try proof by contradiction

hwyl · Answer

just for you, I will study mathematical proofs
oh actually I just downloaded a book for that in my school's library
want a copy ?

dan815 · Answer

this might be generalized to deg n and paths of n+1 length

dan815 · Answer

eh i just want this one question, u dont need much background, tell me if u want calrification on any definition

hwyl · Answer

n0

dan815 · Answer

basically think of having a graph with all vertices with degree 5, how come such a graph can never be completely decomposed into all paths of length 6

hwyl · Answer

I dont know how to do proofs

dan815 · Answer

|dw:1443674847336:dw|