On the minimal density of triangles in graphs

Combinatorics Probability and Computing

Volumn 17, Issue 4, 2008, Pages 603-618

  Razborov, Alexander A ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

EDGE DENSITY;

TRIANGULATION;

EID: 47749131563     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548308009085     Document Type: Article

References (20)

1. Bollobás, B. (1975) Relations between sets of complete subgraphs. In Proc. Fifth British Combin. Conference, pp. 79-84.
2. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
3. Borgs, C., Chayes, J., Lovász, L., Sós, V. T. and Vesztergombi, K. (2006) Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Manuscript, available at http://arxiv.org/abs/math/0702 004.
4. Erdõs, P. (1962) On a theorem of Rademacher-Turán. Illinois J. Math. 6 122-127.
5. Erdõs, P. (1969) On the number of complete subgraphs contained in certain graphs. Casopis Pest. Mat. 94 290-296.
6. Erdõs, P. and Spencer, J. (1974) Probabilistic Methods in Combinatorics, Academic Press.
7. Erdõs, P. and Simonovits, M. (1983) Supersaturated graphs and hypergraphs. Combinatorica 3 181-192.
8. Felix, D. (2005) Asymptotic relations in flag algebras. Manuscript, available at http: //math.ucsd.edu/~df elix/partialorder. pdf.
9. Fisher, D. (1989) Lower bounds on the number of triangles in a graph. J. Graph Theory 13 505-512.
10. Goldwurm, M. and Santini, M. (2000) Clique polynomials have a unique root of smallest modulus. Inform. Process. Lett. 75 127-132.
11. Goodman, A. W. (1959) On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66 778-783.
12. Khadžiivanov, N. and Nikiforov, V. (1978) The Nordhaus-Stewart- Moon-Moser inequality. Serdica 4 344-350. In Russian.
13. Lovász, L. and Simonovits, M. (1983) On the number of complete subgraphs of a graph II. In Studies in Pure Mathematics, Birkhäuser, pp. 459-495.
14. Mantel, W. (1907) Problem. 28: Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff. Wiskundige Opgaven 10 60-61.
15. Moon, J. W. and Moser, L. (1962) On a problem of Turán. Magyar. Tud. Akad. Mat. Kutató Int. Közl 7 283-286.
16. Nikiforov, V. (2007) The number of cliques in graphs of given order and size. Manuscript, available at http: //arxiv.org/abs/0710.2305v2 (version 2).
17. Nordhaus, E. A. and Stewart, B. M. (1963) Triangles in an ordinary graph. Canadian J. Math. 15 33-41.
18. Podolskii, V. V. (2006) Master's thesis, Moscow State University, Moscow. In Russian.
19. Razborov, A. (2007) Flag algebras. J. Symbolic Logic 72 1239-1282.
20. Turán, P. (1941) Egy gráfelméleti szélsöértékfeladatról. Mat. és Fiz. Lapok 48 436-453.