Improved Bounds for Uniform Hypergraphs without Property B

Sachin Aglave, V. A. Amarnath, Saswata Shannigrahi +1

A hypergraph is said to be properly 2-colorable if there exists a 2-coloring of its vertices such that no hyperedge is monochromatic. On the other hand, a hypergraph is called non-…