Packing graphs: The packing problem solved

Yair Caro, Raphael Yuster

Research output: Contribution to journalArticlepeer-review

Abstract

For every fixed graph H, we determine the H-packing number of K n, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P(H, Kn) = [dn/2h[n-1/d]], unless n = 1 mod d and n(n - 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P(H, Kn) = [dn/2h[n - 1/d]] - 1. Our main tool in proving this result is the deep decomposition result of Gustavsson.

Original languageEnglish
Article numberR1
Pages (from-to)1-7
Number of pages7
JournalElectronic Journal of Combinatorics
Volume4
Issue number1 R
StatePublished - 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Packing graphs: The packing problem solved'. Together they form a unique fingerprint.

Cite this