Hyperfinite graph limits

Simple item page
dc.creatorSchramm, Oded
dc.date2007-11-24
dc.date.accessioned2026-07-07T08:44:50Z
dc.date.available2026-07-07T08:44:50Z
dc.descriptionGábor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $ε>0$ there is some finite $k$ such that each graph $G$ in the collection can be broken into connected components of size at most $k$ by removing a set of edges of size at most $ε|V(G)|$. We presently extend this notion to a certain compactification of finite bounded-degree graphs, and show that if a sequence of finite graphs converges to a hyperfinite limit, then the sequence itself is hyperfinite.
dc.identifierhttps://arxiv.org/abs/0711.3808
dc.identifierhttp://arxiv.org/abs/0711.3808
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142799
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60C05; 05C80
dc.titleHyperfinite graph limits
dc.typetext

Files

Collections

arXiv