Randomly keeping each edge with probability about 1/d still leaves a cycle of length nearly d in any average-degree-d graph, and graphs with no d-cycle are nearly disjoint unions of components with small vertex covers.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2roles
method 1polarities
use method 1representative citing papers
A hybrid static-dynamic analysis yields precise asymptotics for small components and extremely sharp bounds on the largest non-giant component in the Bohman-Frieze process near the critical point.
citing papers explorer
-
Counting subgraphs in bounded-size Achlioptas processes
A hybrid static-dynamic analysis yields precise asymptotics for small components and extremely sharp bounds on the largest non-giant component in the Bohman-Frieze process near the critical point.