<F3.725e+05> C. J. H.<F3.823e+05> McDiarmid,<F3.443e+05> On the method of bounded<F3.823e+05> di#erences, in Surveys in Combinatorics, Proc. 12th British Combinatorial Conference, J. Siemons, ed., Vol. 141 of London Math. Soc. Lecture Series, Cambridge University Press, Cambridge, England, 1989, pp. 148--188.  Home/Search   Document Not in Database   Summary   Related Articles

....F 2 has a slightly di#erent definition of F 1 . We simply reorder F according to y v(#) and go through the proof above without using the condition x v(#) # n 1 2 #. The proof of (36) is much simpler. We use the more usual martingale argument (Alon and Spencer [1] Bollobas [4] McDiarmid [14]) for now if Y k = E(X 3 F k ) then Y k Y k 1 # 4 (# 2 n# 2 ) Since we took (in (38) # = 1 # 3#, we have Pr( X 3 E [X 3 ] # t# 3 2 ) # 2 exp # t 2 # 4 n 2 # 4 32# 3 m # # 2 exp # t 2 # 4 n 32# 4 # # 2 exp # t 2 n 288# 6 # . ....

<F3.725e+05> C. J. H.<F3.823e+05> McDiarmid,<F3.443e+05> On the method of bounded<F3.823e+05> di#erences, in Surveys in Combinatorics, Proc. 12th British Combinatorial Conference, J. Siemons, ed., Vol. 141 of London Math. Soc. Lecture Series, Cambridge University Press, Cambridge, England, 1989, pp. 148--188.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC