Abstract
Let S be a finite set of positive integers. A mixed hypergraph H is a one-realization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1. In Zhao et al. (2012), we determined the minimum number of vertices of a 3-uniform bi-hypergraph which is a one-realization of S. In this paper, we generalize this result to r-uniform bi-hypergraphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
