Prove or disprove

Revision en1, by CopeCope, 2019-03-12 17:20:51

Given graph with $N$ vertices and there are $N*(N-1)/2$ edges, each one is either $(i,j)$ or $(j,i)$ for every $1<=i,j<=N$. How to prove or disprove that there is always a path of length $N-1$(edges) that visits every vertex once

#### History

Revisions

Rev. Lang. By When Δ Comment
en1 CopeCope 2019-03-12 17:20:51 246 Initial revision (published)