Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-26T19:12:19.041Z Has data issue: false hasContentIssue false
  • English
  • Français

Packing Circuits into KN

Published online by Cambridge University Press:  10 December 2001

PAUL BALISTER
PAUL BALISTER
Affiliation:
Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA; (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

We shall pack circuits of arbitrary lengths into the complete graph KN. More precisely, if N is odd and [sum ]ti=1mi = (N2), mi [ges ] 3, then the edges of KN can be written as an edge-disjoint union of circuits of lengths m1,…,mt. Since the degrees of the vertices in any such packing must be even, this result cannot hold for even N. For N even, we prove that if [sum ]ti=1mi [les ] (N2) − N−2 then we can write some subgraph of KN as an edge-disjoint union of circuits of lengths m1,…,mt. In particular, KN minus a 1-factor can be written as a union of such circuits when [sum ]ti=1mi = (N2) − N−2. We shall also show that these results are best possible.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 6 , November 2001 , pp. 463 - 499
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)