کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6872367 | 681740 | 2014 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Some results on Lagrangians of hypergraphs
ترجمه فارسی عنوان
برخی نتایج در مورد لگارجنسیان هیپرگراف ها
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Füredi conjectured that the r-graph with m edges formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-graphs with m edges. Talbot in Talbot (2002) provided some evidences for Frankl and Füredi's conjecture. In this paper, we prove that the r-graph with m edges formed by taking the first m sets in the colex ordering of N(r) has the largest Lagrangian of all r-uniform graphs on t vertices with m edges when m=trâp where 0â¤pâ¤târ under some conditions. As an implication, we also derive that Frankl and Füredi's conjecture holds for 3-uniform graphs with m=t3âp edges where 0â¤pâ¤4.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 166, 31 March 2014, Pages 222-238
Journal: Discrete Applied Mathematics - Volume 166, 31 March 2014, Pages 222-238
نویسندگان
Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao,