2-Colorings of uniform hypergraphs

Edge Balanced 3-Uniform Hypergraph Designs

“…Rosa in [15]. Later, a lot of work has been done in this field (see for example [1, 3-7, 9-12, 14-16]) both for graph designs and hypergraph designs.…”

“…Given a hypergraph H, a strong vertex coloring of H assigns distinct colors to the vertices of a 3-edge of H. The minimum number k such that there exists a strong vertex coloring of H with k colors is called strong chromatic number of H and denoted by χ s (H) (see [1,15,16]). In this paper, we consider H-designs, with H hypergraph with 2 or 3 edges, such that χ s (H) = 3.…”