The smallest one-realization of a given set
arXiv:1208.0875
Abstract
In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), P19], we determined the minimum number of vertices of one-realizations of a given finite set , and constructed the corresponding mixed hypergraphs. In this paper, by finding some of their spanning sub-hypergraphs, we determine the minimum number of -deges (resp. -edges) of one-realizations of . As a result, we partially solve an open problem proposed by Tuza and Voloshin in 2008.
9 pages