Finitely forcible graphons

Journal of Combinatorial Theory. Series B

Volumn 101, Issue 5, 2011, Pages 269-301

  Lovasz L ^a   Szegedy, B ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Extremal graph; Finitely forcible graphon; Graph limit; Graphon

Indexed keywords

EID: 79956274232     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2011.03.005     Document Type: Article

References (22)

1. Borgs C., Chayes J., Lovász L. Moments of two-variable functions and the uniqueness of graph limits. Geom. Funct. Anal. 2010, 19:1597-1619.
2. Borgs C., Chayes J., Lovász L., Sós V.T., Vesztergombi K. Counting graph homomorphisms. Topics in Discrete Mathematics 2006, 315-371. Springer. M. Klazar, J. Kratochvil, M. Loebl, J. Matoušek, R. Thomas, P. Valtr (Eds.).
3. Borgs C., Chayes J.T., Lovász L., Sós V.T., Vesztergombi K. Convergent graph sequences, I: Subgraph frequencies, metric properties, and testing. Adv. Math. 2008, 219:1801-1851.
4. Brandstädt A., Le V.B., Spinrad J.P. Graph Classes: A Survey. SIAM Monogr. Discrete Math. Appl. 1999, SIAM.
5. Chung F., Graham R.L., Wilson R.M. Quasi-random graphs. Combinatorica 1989, 9:345-362.
6. Corneil D.G., Lerchs H., Burlingham L.Stewart Complement reducible graphs. Discrete Appl. Math. 1981, 3:163-174.
7. Diaconis P., Holmes S., Janson S. Threshold graph limits and random threshold graphs. Internet Math. 2009, 5:267-318.
8. Dubins L.E. On extreme points of convex sets. J. Math. Anal. Appl. 1962, 5:237-244.
9. Erdo"s P., Lovász L., Spencer J. Strong independence of graphcopy functions. Graph Theory and Related Topics 1979, 165-172. Academic Press.
10. Erdo"s P., Simonovits M. Supersaturated graphs and hypergraphs. Combinatorica 1983, 3:181-192.
11. Frieze A., Kannan R. Quick approximation to matrices and applications. Combinatorica 1999, 19:175-220.
12. S. Janson, Connectedness in graph limits, Tech. Report 2008:8, Uppsala.
13. Karlin S. Extreme points of vector functions. Proc. Amer. Math. Soc. 1953, 4:603-610.
14. Lovász L., Sós V.T. Generalized quasirandom graphs. J. Combin. Theory Ser. B 2008, 98:146-163.
15. Lovász L., Szegedy B. Limits of dense graph sequences. J. Combin. Theory Ser. B 2006, 96:933-957.
16. Lovász L., Szegedy B. Szemerédiés Lemma for the analyst. Geom. Funct. Anal. 2007, 17:252-270.
17. Lovász L., Szegedy B. Contractors and connectors in graph algebras. J. Graph Theory 2009, 60:11-31.
18. Lovász L., Szegedy B. Regularity partitions and the topology of graphons. An Irregular Mind. Szemerédi is 70 2010, 415-446. Springer - J. Bolyai Mathematical Society. I. Bárány, J. Solymosi (Eds.).
19. Razborov A.A. Flag algebras. J. Symbolic Logic 2007, 72:1239-1282.
20. Razborov A.A. On the minimal density of triangles in graphs. Combin. Probab. Comput. 2008, 17:603-618.
21. Simonovits M. A method for solving extremal problems in graph theory, stability problems. Theory of Graphs 1968, 279-319. Academic Press, New York.
22. Zeidler E. Nonlinear Functional Analysis and Its Applications. Part I 1985, Springer, New York.