Day: March 25, 2024

erge, hypergraph, cycle, Turán number 1 Introduction We say that a hypergraph H is a Berge copy of a graph F (in short: H is a Berge-F) if V (F) V and there is a bijection f : E(F) → E(H. such that for any e ∈ E(F) ⊂ we have e (H) f(e). This definition was introduced by Gerbner and Palmer [11], ⊂ extending .