کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647584 | 1632426 | 2014 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On Hamilton cycle decompositions of r-uniform r-partite hypergraphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The definition of edge-adjacency can be generalized in multiple ways to hypergraphs, and extended from that, cycles and Hamilton cycles. One such generalization of a Hamilton cycle is attributed to Kierstead and Katona. In a recent paper by Kuhl and Schroeder, Hamilton cycle decompositions of complete r-partite r-uniform hypergraphs are discussed, a conjecture was made that the necessary numerical conditions are sufficient, and was shown true for some cases. In this paper, the conjecture is proved using constructions involving Hamming codes, comparisons between the two constructions are made, and a classification of when they are equivalent is shown.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volumes 315â316, 6 February 2014, Pages 1-8
Journal: Discrete Mathematics - Volumes 315â316, 6 February 2014, Pages 1-8
نویسندگان
Michael W. Schroeder,