3 problems

Let $H$ be a connected hypergraph. It is $1$-degenerated if every subhypergraph of $H$ has a vertex of degree at most $1$. A hypergraph is $2$-cordial when a labeling of its vertic…

Let $H=(V,E)$ be a hypertree, meaning a connected hypergraph without cycles. For an integer $k\ge 2$, a vertex labeling $f:V\to\mathbb{Z}_k$ induces an edge labeling by…

Let $H=(V,E)$ be a hypertree, meaning a connected hypergraph without cycles. A vertex labeling $f:V\to\mathbb{Z}_2$ induces an edge labeling by $f(e)=\sum_{v\in e}f(v)$ modulo $2$.…