Next: Felix Lazebnik - On Up: Extremal Combinatorics / Combinatoire Previous: Jerrold Griggs - Extremal
Penny Haxell - Integer and fractional packings in dense graphs
| PENNY HAXELL, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada |
| Integer and fractional packings in dense graphs |
Let H0 be any fixed graph. For a graph G we define
to be the maximum size of a set of pairwise edge-disjoint copies of
H0 in G. We say a function 
from the set of copies of H0in G to [0,1] is a fractional H0-packing of G if
for every edge e of G. Then
is defined to be the maximum value of
over all fractional
H0-packings of G. We show that
for all graphs G.
(Joint work with V. Rödl.)
