GRZESIK, Andrzej and Daniel KRÁĽ. Analytic representations of large graphs. In 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.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Analytic representations of large graphs
Authors GRZESIK, Andrzej (616 Poland) and Daniel KRÁĽ (203 Czech Republic, guarantor, belonging to the institution).
Edition Cambridge, Surveys in Combinatorics 2019, p. 57-88, 32 pp. 2019.
Publisher Cambridge University Press
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10101 Pure mathematics
Country of publisher United Kingdom of Great Britain and Northern Ireland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/19:00113689
Organization unit Faculty of Informatics
ISBN 978-1-108-64909-4
Doi http://dx.doi.org/10.1017/9781108649094.003
UT WoS 000668435800002
Keywords in English graph limits; extremal combinatorics; large graphs
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 14/5/2024 12:43.
Abstract
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.
PrintDisplayed: 10/10/2024 18:33