On a conjecture of Bondy (Q1065023)

The authors prove the following conjecture of Bondy: if G is a k- connected graph, where \(k\geq 2\), such that the degree-sum of any \(k+1\) independent vertices is at least m, then G contains a cycle of length at least \(\min (2m/(k+1),n)\) (n denotes the order of G).