The problem of 2-coloring uniform hypergraphs has been extensively studied over the last few decades. An n-uniform hypergraph is not 2-colorable if its vertices cannot be colored with two colors, Red and Blue, such that every hyperedge contains Red as well as Blue vertices. The least possible number of hyperedges in an n-uniform hypergraph which is not 2-colorable is denoted by m(n). In this paper, we consider the problem of finding an upper bound on m(n) for small values of n. We provide constructions which improve the existing results for some such values of n. We obtain the first improvement in the case of n = 8.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.