# Limits of dense graph sequences

@article{Lovsz2006LimitsOD,
title={Limits of dense graph sequences},
author={L{\'a}szl{\'o} Mikl{\'o}s Lov{\'a}sz and Bal{\'a}zs Szegedy},
journal={J. Comb. Theory, Ser. B},
year={2006},
volume={96},
pages={933-957}
}
• Published 12 August 2004
• Mathematics
• J. Comb. Theory, Ser. B
748 Citations

### Limits of compact decorated graphs

• Mathematics
• 2010
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences

### Connectedness in graph limits

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph

### Large Graphs and Graph Limits

We consider sequences of large graphs which have certain convergent graph parameters. Many important graph parameters like the edge density may be represented asymptotically as homomorphism

### Interval Graph Limits

• Mathematics
Annals of combinatorics
• 2013
A graph limit theory for dense interval graphs is work out, which departs from the usual description of a graph limit as a symmetric function W(x, y) on the unit square, with x and y uniform on the interval.

### Independence and chromatic densities of graphs

• Mathematics
• 2011
We consider graph densities in countably inflnite graphs. The independence density of a flnite graph G of order n is its proportion of independent sets to all subsets of vertices, while the chromatic

### Vertex Order in Some Large Constrained Random Graphs

• H. Koch
• Mathematics
SIAM J. Math. Anal.
• 2016
This paper proves that, under an assumption that holds for a wide range of parameter values, the constrained maximizers are in some sense monotone.

### Percolation on dense graph sequences.

• Mathematics
• 2010
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs (G n ). Let λn be the largest eigenvalue of the adjacency matrix of G n , and let G n (p n ) be the

### Graph limits and parameter testing

• Mathematics
STOC '06
• 2006
We define a distance of two graphs that reflects the closeness of both local and global properties. We also define convergence of a sequence of graphs, and show that a graph sequence is convergent if

### Monotone Graph Limits and Quasimonotone Graphs

• Mathematics
Internet Math.
• 2012
It is shown that the kernel is monotone (i.e., increasing in both variables) if and only if the sequence satisfies a “quasimonotonicity” property defined by a certain functional tending to zero.