Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1647317, author = {Grzesik, Andrzej and Kráľ, Daniel}, address = {Cambridge}, booktitle = {Surveys in Combinatorics 2019}, doi = {http://dx.doi.org/10.1017/9781108649094.003}, keywords = {graph limits; extremal combinatorics; large graphs}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Cambridge}, isbn = {978-1-108-64909-4}, pages = {57-88}, publisher = {Cambridge University Press}, title = {Analytic representations of large graphs}, year = {2019} }
TY - JOUR ID - 1647317 AU - Grzesik, Andrzej - Kráľ, Daniel PY - 2019 TI - Analytic representations of large graphs PB - Cambridge University Press CY - Cambridge SN - 9781108649094 KW - graph limits KW - extremal combinatorics KW - large graphs N2 - The recently emerged theory of graph limits provides analytic tools to represent and analyse large graphs, which appear in various scenarios in mathematics and computer science. We survey basic concepts concerning dense graph limits and then focus on recent results on finitely forcible graph limits. We conclude with presenting some of the existing notions concerning sparse graph limits and discussing their mutual relation. ER -
GRZESIK, Andrzej and Daniel KRÁĽ. Analytic representations of large graphs. In \textit{Surveys in Combinatorics 2019}. Cambridge: Cambridge University Press, 2019, p.~57-88. ISBN~978-1-108-64909-4. Available from: https://dx.doi.org/10.1017/9781108649094.003.
|