Question: Let G(n,1/2) be a binomial random graph, prove that with high probability, the minimum cardinality of a set A such that its deletion increases the
Let G(n,1/2) be a binomial random graph, prove that with high probability, the minimum cardinality of a set "A" such that its deletion increases the diameter of G is n(1/4+o(1)).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
