Integer and Fractional Packings in Dense Graphs |
| |
| Authors: | P. E. Haxell V. Rödl |
| |
| Affiliation: | (1) Department of Combinatorics and Optimization, University of Waterloo; Waterloo, Ont., Canada N2L 3G1; E-mail: pehaxell@math.uwaterloo.ca, CA;(2) Department of Mathematics and Computer Science, Emory University; Atlanta, GA, USA 30332; E-mail: rodl@mathcs.emory.edu, US |
| |
| Abstract: | Let be any fixed graph. For a graph G we define to be the maximum size of a set of pairwise edge-disjoint copies of in G. We say a function from the set of copies of in G to [0, 1] is a fractional -packing of G if for every edge e of G. Then is defined to be the maximum value of over all fractional -packings of G. We show that for all graphs G. Received July 27, 1998 / Revised December 3, 1999 |
| |
| Keywords: | AMS Subject Classification (2000) Classes: 05C70, 05C85 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
