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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
