Proving Even Cycle in Graph Theory with 3 x-y Paths

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
1 reply · 2K views
fibi257
Messages
4
Reaction score
0
Hello! This question seems simple but I think I'll need your help to prove it.

Prove that if there are vertices x and y in V(G) such that G contains three independent x-y paths then G contains an even cycle.

Thank you in advance.
 
Mathematics news on Phys.org