Graph decomposition is NPC - a complete proof of Holyer's conjecture
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
The decomposition threshold for bipartite graphs with minimum degree one
Random Structures & Algorithms
Extremal Graph Theory
Integer and fractional packing of families of graphs
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Fractional decompositions of dense hypergraphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
| Hi-index | 0.00 |
Let H be a fixed graph. A fractional H-decomposition of a graph G is an assignment of nonnegative real weights to the copies of H in G such that for each e ∈ E(G), the sum of the weights of copies of H containing e is precisely one. An H-packing of a graph G is a set of edge disjoint copies of H in G. The following results are proved. For every fixed k 2, every graph with n vertices and minimum degree at least n(1 - 1/9k10) + o(n) has a fractional Kk-decomposition and has a Kk-packing which covers all but o(n2) edges.