Let denote the -uniform hypergraph on the vertex set with hyperedges . Recently, Balogh, Clemen and Luo determined the Turán number of a one-vertex blow-up of , more specifically, they blow up the vertex to vertices, the resulting hypergraph is denoted by . They show that for infinitely many , has exponentially many extremal constructions and positive Turán density. In this paper, we determine the exact Turán number of the hypergraph obtained by blowing up of to vertices and show that it also has exponentially many extremal constructions. We also give a general upper bound and lower bound of the Turán number of every blow-up of . For some special blow-ups of , for example, -disjoint copies of , we determine the exact Turán number. We construct a hypergraph which is a subgraph of a blow-up of , and is contained in the hypergraph obtained by adding any new hyperedge to the Turán hypergraph (the balanced complete -partite hypergraph), but its extremal construction is not the Turán hypergraph. We also determine the exact Turán number of .

生成讲解博客的中文版本

生成AI智能校验的中文版本