𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Construction of a perfect set of Euler tours of K2k+1

✍ Scribed by K. Heinrich; H. Verrall

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
190 KB
Volume
5
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

In this article we prove Kotzig's Conjecture by constructing a perfect set of Euler tours of K 2 k+ 1 . As a corollary, we deduce that L(K 2 k+ 1 ), the line graph of K 2 k+ 1 , has a Hamilton decomposition.

πŸ“œ SIMILAR VOLUMES

A construction of a perfect set of Euler
A construction of a perfect set of Euler tours of K2k + I
✍ H. Verrall πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 539 KB

In this article we define a perfect set of Euler tours of K 2k + I, I a 1-factor of K 2k , to be a set of Euler tours of K 2k + I that partition the 2-paths of K 2k , with the added condition that if ab ∈ I, then each Euler tour contains either the digon a b a or b a b. We prove for all k > 1 that K

A polynomial algorithm for constructing
A polynomial algorithm for constructing families of k-independent sets
✍ G. Freiman; E. Lipkin; L. Levitin πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 1003 KB

The present paper describes an algorithm for constructing families of k-independent subsets & of {1,2, . . . , n} with &I >2ck", where c, = d/(k -1)2& and d is a certain constant. The algorithm has a polynomial complexity with respect to the size of the family constructed.

A perfect one-factorization of K52
A perfect one-factorization of K52
✍ Adam J. Wolfe πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 84 KB

## Abstract A starter derived even starter that induces a perfect one‐factorization of __K__~52~ is presented. This is the smallest order for which a perfect one‐factorization was not previously known and is the first new β€œsmall” order for which a perfect one‐factorization has been found in nearly