- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 Generating non-jumping numbers of hypergraphs Bull. Korean Math. Soc.Published online 2019 Jan 14 Shaoqiang Liu and Yuejian Peng Hunan University Abstract : The concept of jump concerns the distribution of Tur\'an densities. A number $\alpha\in[0,1)$ is a jump for $r$ if there exists a constant $c>0$ such that if the Tur\'an density of a family $\mathscr{F}$ of $r$-uniform graphs is greater than $\alpha$, then the Turan density of $\mathscr{F}$ is at least $\alpha+c$. To determine whether a number is a jump or non-jump has been a challenging problem in extremal hypergraph theory. In this paper, we give a way to generate non-jumps for hypergraphs. We show that if $\alpha,\beta$ are non-jumps for $r_1,r_2\geq2$, respectively, then $\frac{\alpha\beta(r_1+r_2)!r_1^{r_1} r_2^{r_2}}{r_1!r_2!(r_1+r_2)^{r_1+r_2}}$ is a non-jump for $r_1+r_2$. We also apply the Lagrangian method to determine the Tur\'an density of the extension of the $(r-3)$-fold enlargement of a $3$-uniform matching. Keywords : Hypergraph; Hypergraph Lagrangian MSC numbers : 05C65; 05D05 Full-Text :