## Abstract

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/9k^{10}) + o (n) has a fractional K_{k} -decomposition and has a K_{k}-packing which covers all but o (n^{2}) edges.

Original language | English |
---|---|

Pages (from-to) | 1-11 |

Number of pages | 11 |

Journal | Journal of Combinatorial Theory. Series B |

Volume | 95 |

Issue number | 1 |

DOIs | |

State | Published - Sep 2005 |

## Keywords

- Decomposition
- Fractional
- Packing

## ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint

Dive into the research topics of 'Asymptotically optimal K_{k}-packing of dense graphs via fractional K

_{k}-decompositions'. Together they form a unique fingerprint.