Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Is there any result that relates the minimum degree of a geometric random graph to its k-vertex connectivity? I read papers where they pose the condition $$d_{\rm min} \geq k$$ to imply that the graph is k-connected (vertex connectivity). Is that an approximation or an asymptotic result? In my case, I need, if not an exact result, a lower bound

$$P({\rm graph~is~connected}) \geq f(d_{\rm min}).$$

I could not find references so far.

share|improve this question

1 Answer 1

up vote 2 down vote accepted

Does this help? http://www.maths.bath.ac.uk/~masmdp/ab/kcon.html

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.