Connected Fair Detachments of Hypergraphs I

Amin Bahmanian

Let $\mathcal{G}$ be a hypergraph whose edges are colored. An {\it $(\alpha ,n)$-detachment} of $\mathcal{G}$ is a hypergraph obtained by splitting a vertex $\alpha$ into $n$ vertices, say $α_1…