2020/01/16 by Khormali, Omid, Palmer, Cory · 2 citations
#05C35 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2001.05631
Fix a graph F. We say that a graph is \it F-free if it does not contain F as a subgraph. The \it Turán number of F, denoted ex(n,F), is the maximum number of edges possible in an n-vertex F-free graph. The study of Turán numbers is a central problem in graph theory. The goal of this paper is to generalize a theorem of Lidický, Liu and Palmer [\it Electron. J. of Combin. \bf 20 (2016)] that determines ex(n,F) for F a forest of stars. In particular, we consider generalizations of the problem to three different well-studied hypergraph settings and in each case we prove an asymptotic result for all reasonable parameters defining our "star forests".