@book{MTMT:2588739,
	title = {Large networks and graph limits},
	url = {https://m2.mtmt.hu/api/publication/2588739},
	isbn = {9780821890851},
	author = {Lovász, László},
	publisher = {AMS},
	unique-id = {2588739},
	year = {2012},
	orcid-numbers = {Lovász, László/0000-0001-6596-0465}
}

@article{MTMT:1086784,
	title = {Limits of Dense Graph Sequences},
	url = {https://m2.mtmt.hu/api/publication/1086784},
	author = {Lovász, László and Szegedy, Balázs},
	doi = {10.1016/j.jctb.2006.05.002},
	journal-iso = {J COMB THEORY B},
	journal = {JOURNAL OF COMBINATORIAL THEORY SERIES B},
	volume = {96},
	unique-id = {1086784},
	issn = {0095-8956},
	abstract = {We show that if a sequence of dense graphs G, has the property that for every fixed graph F, the density of copies of F in G, tends to a limit, then there is a natural "limit object," namely a symmetric measurable function W: [0, 1](2) ->. [0, 1]. This limit object determines all the limits of subgraph densities. Conversely, every such function arises as a limit object. We also characterize graph parameters that are obtained as limits of subgraph densities by the "reflection positivity" property. Along the way we introduce a rather general model of random graphs, which seems to be interesting on its own right. (c) 2006 Elsevier Inc. All rights reserved.},
	keywords = {Quasirandom graph; convergent graph sequence; LIMIT; graph homomorphism},
	year = {2006},
	eissn = {1096-0902},
	pages = {933-957},
	orcid-numbers = {Lovász, László/0000-0001-6596-0465; Szegedy, Balázs/0009-0009-6682-3361}
}