Share  Bookmark

 Download from


 Funded by

[1] Aristoff, D. and Radin, C. (2013) Emergent structures in large networks. J. Appl. Probab. 50 883888.
[2] Bollob a´s, B. (1976) On complete subgraphs of different orders. Math. Proc. Camb. Phil. Soc. 79 1924.
[3] Borgs, C., Chayes, J., Lov a´sz, L., So´ s, V. T. and Vesztergombi, K. (2008) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Adv. Math. 219 18011851.
[4] Chatterjee, S. and Dembo, A. (2014) Nonlinear large deviations. arXiv:1401.3495
[5] Chatterjee, S. and Dey, P. S. (2010) Applications of Stein's method for concentration inequalities. Ann. Probab. 38 24432485.
[6] Chatterjee, S. and Diaconis, P. (2013) Estimating and understanding exponential random graph models. Ann. Statist. 41 24282461.
[7] Chatterjee, S. and Varadhan, S. R. S. (2011) The large deviation principle for the Erdo˝sRe´nyi random graph. Europ. J. Combin. 32 10001017.
[8] Cummings, J., Kr a´l', D., Pfender, F., Sperfeld, K., Treglown, A. and Young, M. (2013) Monochromatic triangles in threecoloured graphs. J. Combin. Theory Ser. B 103 489503.
[9] Das, S., Huang, H., Ma, J., Naves, H. and Sudakov, B. (2013) A problem of Erdo˝s on the minimum number of kcliques. J. Combin. Theory Ser. B 103 344373.
[10] Erdo˝s, P. (1955) Some theorems on graphs. Riveon Lematematika 9 1317.
The information is available from the following content providers:
From  Number Of Views  Number Of Downloads 

Warwick Research Archives Portal Repository  IRUSUK  0  18 