Induced Tur\'an problems and traces of hypergraphs

18 Feb 2020 Furedi Zoltan Luo Ruth

Let $F$ be a graph. We say that a hypergraph $H$ contains an induced Berge $F$ if the vertices of $F$ can be embedded to $H$ (e.g., $V(F)\subseteq V(H)$) and there exists an injective mapping $f$ from the edges of $F$ to the hyperedges of $H$ such that $f(xy) \cap V(F) = \{x,y\}$ holds for each edge $xy$ of $F$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS