Paths in hypergraphs: a rescaling phenomenon

From MaRDI portal
Publication:5244124




Abstract: Let Pekll denote the loose k-path of length ell and let define fekll(n,m) as the minimum value of Delta(H) over all Pekll-free k-graphs H with n vertices and m edges. In the paper we study the behavior of f24(n,m) and f33(n,m) and characterize the structure of extremal hypergraphs. In particular, it is shown that when msimn2/8 the value of each of these functions drops down from Theta(n2) to Theta(n).









This page was built for publication: Paths in hypergraphs: a rescaling phenomenon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244124)