Author/Authors :
B. Bollobas، نويسنده , , P Erd?s، نويسنده , , R.J. Faudree، نويسنده , , C.C Rousseau، نويسنده , , R.H. Schelp، نويسنده ,
Abstract :
Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequence of graphs satisfying |Hn|=n and δ(Hn)⩾d(n), then almost every induced subgraph of Hn has property Q? We prove essentially best possible results for the following monotone properties: (i) k-connected for fixed k, (ii) Hamiltonian.
