N. Alon and F. R. Chung, Explicit construction of linear sized tolerant networks, Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, pp.15-19, 1986.
DOI : 10.1016/0012-365X(88)90189-6

J. Beck, On size Ramsey number of paths, trees, and circuits. I, Journal of Graph Theory, vol.20, issue.1, pp.115-130, 1983.
DOI : 10.1002/jgt.3190070115

J. Beck, On Size Ramsey Number of Paths, Trees and Circuits. II, Mathematics of Ramsey Theory Alorithms and Combin, vol.5, pp.34-45, 1990.
DOI : 10.1007/978-3-642-72905-8_4

J. Beck, Achievement games and the probabilistic method, in: Combinatorics, Paul Erd? os is Eighty, Bolyai Soc. Math. Stud, vol.1, pp.51-78, 1993.

B. Bollobás, Random graphs, 1986.

V. Chvátal, V. Rödl, E. Szemerédi, and W. T. Trotter, The Ramsey number of a graph with bounded maximum degree, Journal of Combinatorial Theory, Series B, vol.34, issue.3, pp.239-243, 1983.
DOI : 10.1016/0095-8956(83)90037-0

J. Donadelli, P. E. Haxell, and Y. Kohayakawa, A note on the size-Ramsey number of long subdivisions of graphs, RAIRO-Inf, Theor. Appl, vol.39, pp.191-206, 2005.

P. Erd?-os, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The size Ramsey number, Periodica Mathematica Hungarica, vol.10, issue.1-2, pp.145-161, 1978.
DOI : 10.1007/BF02018930

P. Erd?-os and R. L. Graham, On partitions theorems for finite graphs, Infinite and Finite Sets, Math. Soc. János Bolyai, vol.1, issue.10, pp.515-527, 1975.

E. Friedgut, Y. Kohayakawa, V. Rödl, A. Ruci´nskiruci´nski, and P. Tetali, Ramsey Games Against a One-Armed Bandit, Combinatorics, Probability and Computing, vol.12, pp.515-545, 2003.
DOI : 10.1017/S0963548303005881

J. Friedman and N. Pippenger, Expanding graphs contain all small trees, Combinatorica, vol.14, issue.1, pp.71-76, 1987.
DOI : 10.1007/BF02579202

J. A. Grytczuk, M. Ha?uszczak, and H. A. Kierstead, On-line Ramsey Theory, Electronic Journal of Combinatorics, vol.11, issue.10, p.pp, 2004.

H. A. Kierstead and G. Konjevod, Coloring number and on-line Ramsey theory for graphs and hypergraphs, Combinatorica, vol.25, issue.1???2
DOI : 10.1007/s00493-009-2264-1

A. Kurek and A. Ruci´nskiruci´nski, Two variants of the size Ramsey number, Discussiones Mathematicae Graph Theory, vol.25, issue.1-2, pp.141-149, 2005.
DOI : 10.7151/dmgt.1268

O. Pikhurko, Asymptotic Size Ramsey Results for Bipartite Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.1, pp.99-113, 2002.
DOI : 10.1137/S0895480101384086

O. Pikhurko, Size Ramsey Numbers of Stars Versus 3-chromatic Graphs, Combinatorica, vol.21, issue.3, pp.403-412, 2001.
DOI : 10.1007/s004930100004

O. Pikhurko, Size ramsey numbers of stars versus 4-chromatic graphs, Journal of Graph Theory, vol.248, issue.3, pp.220-233, 2003.
DOI : 10.1002/jgt.10086

P. Pra?at, A note on small on-line Ramsey numbers for paths and their generalization, Australasian Journal of Combinatorics, vol.40, pp.27-36, 2008.

P. Pra?at, A note on off-diagonal small on-line Ramsey numbers for paths, Ars Combinatoria, p.10

V. Rödl and E. Szemerédi, On size Ramsey numbers of graphs with bounded maximum degree, Combinatorica, vol.20, pp.257-262, 2000.