Publication details
Analytic representations of large graphs
| Authors | |
|---|---|
| Year of publication | 2019 |
| Type | Article in Proceedings |
| Conference | Surveys in Combinatorics 2019 |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1017/9781108649094.003 |
| Keywords | graph limits; extremal combinatorics; large graphs |
| Description | 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. |