We consider a hypergraph generalization of a conjecture of Burr and Erdos concerning the Ramsey number of graphs with bounded degree. It was shown by Chvatal, Rodl, Trotter, and Szemeredi [The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), no. 3, 239-243] that the Ramsey number R(G) of a graph G of bounded maximum degree is linear in vertical bar V(G)vertical bar. We derive the analogous result for 3-uniform hypergraphs.
机构:
Qinghai Normal Univ, Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R China
Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R ChinaQinghai Normal Univ, Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R China
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Comp Sci, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Comp Sci, IL-69978 Tel Aviv, Israel
Ben-Eliezer, Ido
Krivelevich, Michael
论文数: 0引用数: 0
h-index: 0
机构:
Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Math Sci, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Comp Sci, IL-69978 Tel Aviv, Israel
Krivelevich, Michael
Sudakov, Benny
论文数: 0引用数: 0
h-index: 0
机构:
Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USATel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Sch Comp Sci, IL-69978 Tel Aviv, Israel