1 votes 1 votes Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k. Graph Theory jest 2019 discrete-mathematics + – dan31 asked Feb 17, 2019 edited Feb 17, 2019 by dan31 dan31 403 views answer comment Share Follow See 1 comment See all 1 1 comment reply Sayan Bose commented Feb 18, 2019 reply Follow Share Couldn't solve this in the exam 😶 Looked up online and found this : https://math.stackexchange.com/questions/1541302/show-that-g-contains-a-cycle-of-length-at-least-sqrt-k 0 votes 0 votes Please log in or register to add a comment.