You have just completed your registration at OpenAire.
Before you can login to the site, you will need to activate your account.
An e-mail will be sent to you with the proper instructions.
Important!
Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version
of the site upon release.
We consider the problem of minimizing the number of triangles in a graph of given order and size, and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.
[11] Erdo˝s, P. (1962) On a theorem of Rademacher-Tur a´n. Illinois J. Math. 6 122-127.
[12] Erdo˝s, P. (1967) Some recent results on extremal problems in graph theory: Results. In Theory of Graphs: Rome 1966, Gordon and Breach, pp. 117-123 (English); pp. 124-130 (French).
[13] Erdo˝s, P. (1969) On the number of complete subgraphs and circuits contained in graphs. Cˇasopis Pˇest. Mat. 94 290-296.
[14] Erdo˝s, P., Frankl, P. and Ro¨dl, V. (1986) The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2 113-121.
[15] Fisher, D. C. (1989) Lower bounds on the number of triangles in a graph. J. Graph Theory 13 505-512.
[16] Frieze, A. and Kannan, R. (1999) Quick approximation to matrices and applications. Combinatorica 19 175-220.
[17] Hatami, H., Hladk y´, J., Kr a´l', D., Norine, S. and Razborov, A. (2013) On the number of pentagons in triangle-free graphs. J. Combin. Theory Ser. A 120 722-732.
[18] Komlo´ s, J. and Simonovits, M. (1996) Szemere´di's regularity lemma and its applications to graph theory. In Combinatorics: Paul Erdo˝s is Eighty (D. Mikl o´s, V. T. S o´s and T. Szo˝nyi, eds), Vol. 2, Bolyai Mathematical Society, pp. 295-352.
[19] Lov a´sz, L. (2012) Large Networks and Graph Limits, Colloquium Publications, AMS.
[20] Lov a´sz, L. and Simonovits, M. (1976) On the number of complete subgraphs of a graph. In Proc. 5th British Combinatorial Conference: Aberdeen 1975. Congress. Numer. XV 431-441.
[21] Lov a´sz, L. and Simonovits, M. (1983) On the number of complete subgraphs of a graph II. In Studies in Pure Mathematics, Birkha¨user, pp. 459-495.
[22] Lov a´sz, L. and Szegedy, B. (2006) Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957.
[30] Pikhurko, O. and Vaughan, E. R. (2013) Minimum number of k-cliques in graphs with bounded independence number. Combin. Probab. Comput. 22 910-934.
[37] Ruzsa, I. Z. and Szemere´di, E. (1978) Triple systems with no six points carrying three triangles. In Combinatorics II (A. Hajnal and V. So´ s, eds), North-Holland, pp. 939-945.
[38] Simonovits, M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs: Tihany 1966, Academic, pp. 279-319.
[39] Tur a´n, P. (1941) On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48 436-452.