On a Conjecture for a Hypergraph Edge Coloring Problem

Wieslaw Kubiak

Let $H=(\mathcal{M}\cup \mathcal{J},E\cup \mathcal{E})$ be a hypergraph with two hypervertices ${\mathcal{G}}_1$ and ${\mathcal{G}}_2$ where $\mathcal{M} =\mathcal{G}_{1} \cup \mat…