𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On bipartite 2-factorizations of kn − I and the Oberwolfach problem

✍ Scribed by Darryn Bryant; Peter Danziger

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
180 KB
Volume
68
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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-factors isomorphic to F i for i = 1, 2, . . . , t. This result completes the solution of the Oberwolfach problem for bipartite 2-factors.

📜 SIMILAR VOLUMES

On the decomposition of kn into complete
On the decomposition of kn into complete bipartite graphs
✍ H. Tverberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.

1-rotational k-factorizations of the com
1-rotational k-factorizations of the complete graph and new solutions to the Oberwolfach problem
✍ Marco Buratti; Gloria Rinaldi 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We consider __k__‐factorizations of the complete graph that are 1‐__rotational__ under an assigned group __G__, namely that admit __G__ as an automorphism group acting sharply transitively on all but one vertex. After proving that the __k__‐factors of such a factorization are pairwise i

A generalization of the Oberwolfach prob
A generalization of the Oberwolfach problem
✍ S. I. El-Zanati; S. K. Tipnis; C. Vanden Eynden 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## 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 Perio

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ Jiří Fiala 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

Some new results on 1-rotational 2-facto
Some new results on 1-rotational 2-factorizations of the complete graph
✍ Tommaso Traetta 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans