On a generalization of the Oberwolfach problem

Let e(1),e(2),... e(n) be a sequence of nonnegative integers Such that the first non-zero term is not one. Let Sigma(i=1)(n) e(i) = (q - 1)/2, where q = p(n) and p is an odd prime. We prove that the complete graph on q vertices can be decomposed into e(1) C-pn-factors, e(2) C-pn (1)-factors,..., and e(n) C-p-factors. (C) 2004 Elsevier Inc. All rights reserved.

Aurifeuillian factorization

The Cunningham project seeks to factor numbers of the form bn±1 with b = 2, 3, . . . small. One of the most useful techniques is Aurifeuillian Factorization whereby such a number is partially factored by replacing bn by a polynomial in such a way that polynomial factorization is possible. For example, by substituting y = 2k into the polynomial factorization (2y2)2+1 = (2y2−2y+1)(2y2+2y+1) we can partially factor 24k+2+1. In 1962 Schinzel gave a list of such identities that have proved useful in the Cunningham project; we believe that Schinzel identified all numbers that can be factored by such identities and we prove this if one accepts our definition of what “such an identity” is. We then develop our theme to similarly factor f(bn) for any given polynomial f, using deep results of Faltings from algebraic geometry and Fried from the classification of finite simple groups.