𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the Oberwolfach problem

✍ Scribed by S. I. El-Zanati; S. K. Tipnis; C. Vanden Eynden

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
117 KB
Volume
41
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let n > 1 be an integer and let a~2~,a~3~,…,a~n~ be nonnegative integers such that $\sum_{i=2}^{n} a_i=2^{n-1} - 1$. Then $K_{2^n}$ can be factored into $a_2 C_{2^2}$‐factors, $a_3 C_{2^3}$‐factors,…,$a_n C_{2^n}$‐factors, plus a 1‐factor. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 41: 151–161, 2002

πŸ“œ SIMILAR VOLUMES

Some observations on the oberwolfach pro
Some observations on the oberwolfach problem
✍ Brian Alspach; Roland HΓ€ggkvist πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 425 KB

Some results concerning decompositions of Kn, K,, -F (where F denotes a I-factor) and complements of a family of special cubic graphs into 2factors of the same type are given. In particular, if 2d is a divisor of n, it is shown that K, -F can be decomposed into 2-factors each of whose components is

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,

On bipartite 2-factorizations of kn βˆ’ I
On bipartite 2-factorizations of kn βˆ’ I and the Oberwolfach problem
✍ Darryn Bryant; Peter Danziger πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 180 KB

It is shown that if F 1 , F 2 , ...,F t are bipartite 2-regular graphs of order n and 1 , 2 , . . . , t are positive integers such that 1 + 2 +β€’ β€’ β€’+ t = (n-2) / 2, 1 β‰₯ 3 is odd, and i is even for i = 2, 3, . . . , t, then there exists a 2-factorization of K n -I in which there are exactly i 2-facto

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv