Skip to main content
SpringerLink
Log in

Integer and Fractional Packings in Dense Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo; Waterloo, Ont., Canada N2L 3G1; E-mail: pehaxell@math.uwaterloo.ca, , , , , , CA

    P. E. Haxell

  2. Department of Mathematics and Computer Science, Emory University; Atlanta, GA, USA 30332; E-mail: rodl@mathcs.emory.edu, , , , , , US

    V. Rödl

Authors
  1. P. E. Haxell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 27, 1998 / Revised December 3, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haxell, P., Rödl, V. Integer and Fractional Packings in Dense Graphs. Combinatorica 21, 13–38 (2001). https://doi.org/10.1007/s004930170003

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930170003

Search

Navigation