Dismantling sparse random graphs

Simple item page
dc.creatorJanson, Svante
dc.creatorThomason, Andrew
dc.date2007-09-12
dc.date.accessioned2026-07-07T08:29:03Z
dc.date.available2026-07-07T08:29:03Z
dc.descriptionWe consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0709.1787
dc.identifierhttp://arxiv.org/abs/0709.1787
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137829
dc.subjectCombinatorics
dc.subject05C80; 05C40, 92D30
dc.titleDismantling sparse random graphs
dc.typetext

Files

Collections

arXiv