Flag algebras

Journal of Symbolic Logic

Volumn 72, Issue 4, 2007, Pages 1239-1282

  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

EID: 38049143735     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1203350785     Document Type: Article

References (20)

1. J. BOCHNAK, M. COSTE, and M. ROY, Real algebraic geometry, Springer-Verlag, 1998.
2. B. BOLLOBÁS, Relations between sets of complete subgraphs, Proceedings of the Fifth British Combinatorial Conference (C. St.J. A. Nash-Williams and J. Sheehan, editors), Utilitas Mathematica Publishing, 1976, pp. 79-84.
3. J. A. BONDY, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture. Discrete Mathematics, vol. 165/166 (1997), pp. 71-80.
4. B. BORCHERS, CSDP, a C library for semidefinite programming, Optimization Methods and Software, vol. 11 (1999), no. 1, pp. 613-623.
5. C. BORGS, J. CHAYES, L. LOVÁSZ, V.T. SÓS, and K. VESZTERGOMBI, Counting graph homomorphisms, Topics in discrete mathematics (M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, and P. Valtr, editors), Springer, 2006, pp. 315-371.
6. L. CACCETTA and R. HÄGGKVIST, On minimal digraphs with given girth, Congressus Numerantium, vol. 21 (1978), pp. 181-187.
7. F. R. K. CHUNG, R. L. GRAHAM, and R. M. WILSON, Quasi-random graphs, Combinatorica, vol. 9 (1989), pp. 345-362.
8. D. DE CAEN and Z. FÜREDI, The maximum size of3-uniform hypergraphs not containing a Fano plane, Journal of Combinatorial Theory, Series B, vol. 78 (2000), pp. 274-276.
9. P. ERDÖS and J. SPENCER, Probabilistic methods in combinatorics, Academic Press, 1974.
10. P. ERDÖS and M. SIMONOVITS, Supersaturated graphs and hypergraphs, Combinatorica, vol. 3 (1983), no. 2, pp. 181-192.
11. D. FELIX, Asymptotic relations in flag algebras, Manuscript, 2005.
12. D. FISHER, Lower bounds on the number of triangles in a graph, Journal of Graph Theory, vol. 13 (1989), no. 4, pp. 505-512.
13. M. FREEDMAN, L. LOVASZ, and A. SCHRIJVER, Reflection positivity, rank connectivity, and homomorphism of graphs, Manuscript, 2004.
14. A. W. GOODMAN, On sets of acquaintances and strangers at any party, American Mathematical Monthly, vol. 66 (1959), no. 9, pp. 778-783.
15. D. YU. GRIGORIEV, E. A. HIRSCH, and D. V. PASECHNIK, Complexity of semi-algebraic proofs, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, 2002, pp. 419-430.
16. L. LOVÁSZ and M. SIMONOVITS, On the number of complete subgraphs of a graph, II, Studies in pure mathematics, Birkhäuser, 1983, pp. 459-495.
17. L. LOVÁSZ and B. SZEGEDY, Limits of dense graph sequences, Technical Report TR-2004-79, Microsoft Research, August 2004.
18. W. MANTEL, Problem 28, solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff, Wiskundige Opgaven, vol. 10 (1907), pp. 60-61.
19. V. V. PODOLSKI, Master's thesis, Moscow State University, Moscow, 2006, (in Russian).
20. P. TURÁN, Egy gráfelméleti szélsöértékfeladatról, Matematicko Fizicki Lapok vol. 48 (1941), pp. 436-453.