Proving a certain path in an oriented graph

57 Views Asked by At

Let G be an oriented graph with $2^k$ vertices and between every 2 vertices there is exactly 1 edge. I need to prove that, no matter the orientation of G's edges, there is a path in G with k + 1 different vertices.