A hypergraph has property \(\mathcal{B}\) (or chromatic number two) if there is a set which intersects each of its edges, but contains none of its edges. The number of edges in a smallest \(n\)-graph which does not have property \(\mathcal{B}\) is denoted \(m(n)\). This function has proved difficult to evaluate for \(n > 3\). As a consequence, several refinements and variations of the function \(m\) have been studied. In this paper, we describe an effort to construct, via computer, hypergraphs that improve current estimates of such functions.