On the independence number of random graphs
Discrete Mathematics
On the independence and chromatic numbers of random regular graphs
Journal of Combinatorial Theory Series B
New upper bounds on harmonious colorings
Journal of Graph Theory
Bisecting sparse random graphs
Random Structures & Algorithms
Journal of Combinatorial Theory Series B
Decycling numbers of random regular graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Concentration for Independent Permutations
Combinatorics, Probability and Computing
Random Structures & Algorithms
A simple solution to the k-core problem
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
The phase transition in inhomogeneous random graphs
Random Structures & Algorithms
Maximum acyclic and fragmented sets in regular graphs
Journal of Graph Theory
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph have 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 → ∞, then the number in question is essentially the same for all values of k that satisfy both k → ∞ and k =o(n).