GATE CSE
First time here? Checkout the FAQ!
x
0 votes
7 views
A $\textit{simple path}$ (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex os repeated. The $length$ of such a path (respectively cycle) is the number of edges in the path (respectively cycle).

Let $G$ be an undirected graph with minimum degree $k \geq 2$.

Show that $G$ contains a simple cycle of length at least $k+1$.
asked in Others by Veteran (76k points)   | 7 views

Please log in or register to answer this question.



Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2254 Points

  6. 2018

    1514 Points

  7. Vignesh Sekar

    1344 Points

  8. Akriti sood

    1262 Points

  9. Bikram

    1258 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,454 questions
26,775 answers
60,982 comments
22,994 users