
 
Tur´an Problems for Berge(k, p)Fan Hypergraph* 
 
Citation： 
Zhenyu NI,Liying KANG,Erfang SHAN.Tur´an Problems for Berge(k, p)Fan Hypergraph*[J].Chinese Annals of Mathematics B,2021,42(4):487~494 
Page view： 132
Net amount： 114 
Authors： 
Zhenyu NI; Liying KANG;Erfang SHAN 
Foundation： 
National Natural Science Foundation of China (Nos. 11871329,11971298). 


Abstract： 
Let F be a graph. A hypergraph H is BergeF if there is a bijection f : E(F) → E(H) such that e ? f(e) for every e ∈ E(F). A hypergraph is BergeFfree if it does not contain a subhypergraph isomorphic to a BergeF hypergraph. The authors denote the maximum number of hyperedges in an nvertex runiform BergeFfree hypergraph by ex_{r}(n, BergeF).A (k, p)fan, denoted by F_{k,p}, is a graph on k(p ? 1) + 1 vertices consisting of k cliques with p vertices that intersect in exactly one common vertex. In this paper they determine the bounds of ex_{r}(n, BergeF) when F is a (k, p)fan for k ≥ 2, p ≥ 3 and r ≥ 3. 
Keywords： 
Bergehypergraph, Tur´an number 
Classification： 
05C35 

Download PDF FullText



