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.
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
citing papers explorer
-
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.
- Triangle packings in randomly perturbed graphs