The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
57 views
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.
in Graph Theory by Junior (853 points)
edited by | 57 views
0

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  

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,339 questions
55,765 answers
192,355 comments
90,815 users