z-logo
Premium
A generalization of the Oberwolfach problem
Author(s) -
ElZanati S. I.,
Tipnis S. K.,
Vanden Eynden C.
Publication year - 2002
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10058
Subject(s) - mathematics , combinatorics , generalization , integer (computer science) , graph , discrete mathematics , computer science , mathematical analysis , programming language
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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom