For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2representative citing papers
Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.
citing papers explorer
-
Triangle packings in randomly perturbed graphs
For any dn-regular graph perturbed by G(n,p) with p > 2d/(1+2d), there is whp a triangle packing covering all but o(n²) edges, and the bound is optimal for 0 < d ≤ 1/2.
-
Fractional clique decompositions of dense balanced multipartite graphs
Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.