کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648560 1632439 2010 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hamilton-chain saturated hypergraphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Hamilton-chain saturated hypergraphs
چکیده انگلیسی

We say that a hypergraph HH is hamiltonian path (cycle) saturated if HH does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) hamiltonian chain in HH. In this paper we ask about the smallest size of an rr-uniform hamiltonian path (cycle) saturated hypergraph, mainly for r=3r=3. We present a construction of a family of 3-uniform path (cycle) saturated hamiltonian hypergraphs with O(n5/2)O(n5/2) edges. On the other hand we prove that the number of edges in an rr-uniform hamiltonian path (cycle) saturated hypergraph is at least Ω(nr−1)Ω(nr−1).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issues 6–7, 6 April 2010, Pages 1172–1176
نویسندگان
, , ,