Is there an analogy of a vertex separator for hypergraphs? Numerous parameters are defined and considered in the graph theory. I am interested in analogy of these parameters in theory of hypergraphs.

Is there some survey or book or lecture notes about various hypergraph parameters such as independent set, matching, separator, cut, and so on?

In particular, I am interested in an analogy of separator. For a graph $G=(V,E)$, a separator $S$ is a subset of vertices such that removing all elements in $S$ we can obtain two or more separated components $G_{1},G_{2},...$. I am interested in minimum size of separator for hypergraphs.
heres an example


PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING
APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS KAYAASLAN et al


(there is also some research on hypergraph edge separators used in SAT solvers &amp; other edge separators but not incl it because you asked for vertex separators although there is possibly/presumably some connection.)