Dismantling Sparse Random Graphs
2008 ◽
Vol 17
(2)
◽
pp. 259-264
◽
We consider the number of vertices that must be removed from a graphGin order that the remaining subgraph have no component with more thankvertices. Our principal observation is that, ifGis a sparse random graph or a random regular graph onnvertices withn→ ∞, then the number in question is essentially the same for all values ofkthat satisfy bothk→ ∞ andk=o(n).
2018 ◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1975 ◽
Vol 77
(2)
◽
pp. 313-324
◽
Keyword(s):
2009 ◽
Vol 18
(4)
◽
pp. 583-599
◽
1989 ◽
Vol 26
(01)
◽
pp. 103-112
◽
Keyword(s):
2020 ◽
Vol 29
(5)
◽
pp. 757-779
◽
Keyword(s):