Skip to main content

Flag algebras

  • Alexander A. Razborov (a1) (a2)

Asymptotic extremal combinatorics deals with questions that in the language of model theory can be re-stated as follows. For finite models M, N of an universal theory without constants and function symbols (like graphs, digraphs or hypergraphs), let p(M, N) be the probability that a randomly chosen sub-model of N with ∣M∣ elements is isomorphic to M. Which asymptotic relations exist between the quantities p(M1,N),…, p(Mh,N), where M1,…, M1, are fixed “template” models and ∣N∣ grows to infinity?

In this paper we develop a formal calculus that captures many standard arguments in the area, both previously known and apparently new. We give the first application of this formalism by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.

Hide All
[BCR]Bochnak, J., Coste, M., and Roy, M., Real algebraic geometry, Springer-Verlag, 1998.
[Bol]Bollobás, B., Relations between sets of complete subgraphs, Proceedings of the Fifth British Combinatorial Conference (Nash-Williams, C. St.J. A. and Sheehan, J., editors). Utilitas Mathematica Publishing, 1976, pp. 7984.
[Bon]Bondy, J. A., Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, Discrete Mathematics, vol. 165/166 (1997), pp. 7180.
[Bor]Borchers, B., CSDP, a C library for semidefinite programming, Optimization Methods and Software, vol. 11 (1999), no. 1, pp. 613623.
[BCL*]Borgs, C., Chayes, J., Lovász, L., Sós, V.T., and Veszteroombi, K., Counting graph homomorphisms, Topics in discrete mathematics (Klazar, M., Kratochvil, J., Loebl, M., Matousek, J., Thomas, R., and Valtr, P., editors), Springer, 2006, pp. 315371.
[CaH]Caccetta, L. and Häggkvist, R., On minimal digraphs with given girth, Congressus Numerantium, vol. 21 (1978), pp. 181187.
[GGW]Chung, F. R. K., Graham, R. L., and Wilson, R. M., Quasi-random graphs, Combinatorica, vol. 9 (1989), pp. 345362.
[CaF]Caen, D. De and Füredi, Z., The maximum size of 3-uniform hypergraphs not containing a Fano plane, Journal of Combinatorial Theory, Series B, vol. 78 (2000), pp. 274276.
[ErSp]Erdös, P. and Spencer, J., Probabilistic methods in combinatorics, Academic Press, 1974.
[ErSi]Erdös, P. and Simonovits, M., Supersaturated graphs and hypergraphs, Combinatorica, vol. 3 (1983), no. 2, pp. 181192.
[Fel]Felix, D., Asymptotic relations in flag algebras, Manuscript, 2005.
[Fish]Fisher, D., Lower bounds on the number of triangles in a graph. Journal of Graph Theory, vol. 13 (1989), no. 4, pp. 505512.
[FLS]Freedman, M., Lovász, L., and Schrijver, A., Reflection positivity, rank connectivity, and homomorphism of graphs, Manuscript, 2004.
[Goo]Goodman, A. W., On sets of acquaintances and strangers at any party, American Mathematical Monthly, vol. 66 (1959), no. 9, pp. 778783.
[GHP]Grigoriev, D. Yu., Hirsch, E. A., and Pasechnik, D. V., Complexity of semi-algebraic proofs, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, 2002, pp. 419430.
[LoSi]Lovász, L. and Simonovits, M., On the number of complete subgraphs of a graph, II, Studies in pure mathematics, Birkhäuser, 1983, pp. 459495.
[LoSz]Lovász, L. and Szegedy, B., Limits of dense graph sequences, Technical Report TR-2004-79, Microsoft Research, 08 2004.
[Man]Mantel, W., Problem 28, solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W.A. Wythoff, Wiskundige Opgaven, vol. 10 (1907), pp. 6061.
[Pod]Podolski, V. V., Master's thesis, Moscow State University, Moscow, 2006, (in Russian).
[Tur]Turán, P., Egy gráfelméleti szélsöértékfeladatról, Matematicko Fizicki Lapok, vol. 48 (1941), pp. 436453.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed