Constructions via Hamiltonian theorems

TitleConstructions via Hamiltonian theorems
Publication TypeConference Paper
AuthorsKatona, G. O. H.
Year2005
Pages87 - 103
Conference NameDiscrete Mathematics
Languageeng
ISBN Number0012-365X
Notes

exported from refbase (http://www.bibliography.ceu.hu/show.php?record=6258), last updated on Tue, 01 Dec 2009 13:33:45 +0100

Publisher linkhttp://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V00-4H98T70-4-KM&_cdi=5632&_user=7105836&_orig=browse&_coverDate=11%2F06%2F2005&_sk=996969998&view=c&wchp=dGLzVtz-zSkzk&md5=7cf59e89e768c3f519b89945a99988df&ie=/sdarticle.pdf
Abstract

Demetrovics et al [Design type problems motivated by database theory, J. Statist. Plann. Inference 72 (1998) 149-164] constructed a decomposition of the family of all k-element subsets of an n-element set into disjoint pairs (A, B) (A boolean AND B = 0, vertical bar A vertical bar = vertical bar B vertical bar = k) where two such pairs are relatively far from each other in some sense. The paper invented a proof method using a Hamiltonian-type theorem. The present paper gives a generalization of this tool, hopefully extending the power of the method. Problems where the method could be also used are shown. Moreover, open problems are listed which are related to the Hamiltonian theory. In these problems a cyclic permutation is to be found when certain restrictions are given by a family of k-element subsets. (c) 2005 Elsevier B.V. All rights reserved.