Advertisement

Graphs and Combinatorics

, Volume 32, Issue 2, pp 835–850 | Cite as

More Result on the Smallest One-Realization of a Given Set

  • Ping Zhao
  • Kefeng Diao
  • Fuliang Lu
Original Paper

Abstract

For any set S of positive integers, a mixed hypergraph \({\mathcal {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 this paper, a tight lower bound on the minimum number of edges of 3-uniform bi-hypergraphs which are one-realizations of a given set S is presented. As a result, we partially solve an open problem proposed by Bujtás and Tuza in 2008.

Keywords

Mixed hypergraph Feasible set Chromatic spectrum One-realization 

Notes

Acknowledgments

We thanks the referees for helpful suggestions. This research is supported by NSF of Shandong Province (ZR2013AL009, 2014ZRB019GU), promotive research fund for excellent young and middle-aged scientists of Shandong province(Grant no. BS2013DX026), AMEP of Linyi University, NSF of China (11301251).

References

  1. 1.
    Bacsó, G., Tuza, Zs., Voloshin, V.: Unique colorings of bi-hypergraphs. Australas. J. Combin. 27, 33–45 (2003)Google Scholar
  2. 2.
    Bujtás, Cs., Tuza, Zs.: Uniform mixed hypergraphs: the possible numbers of colors. Graphs Combin. 24, 1–12 (2008)Google Scholar
  3. 3.
    Diao, K., Zhao, P., Wang, K.: The smallest one-realization of a given set III. Graphs Combin. 30, 875–885 (2014)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Diao, K., Voloshin, V., Wang, K., Zhao, P.: The smallest one-realization of a given set IV. Discrete Math 338, 712–724 (2015)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Jaffe, A., Moscibroda, T., Sen, S.: On the price of equivocation in byzantine agreement. In Proceedings of the 2012 ACM symposium on Principles of distributed computing, pages 309–318, ACM New York, NY, USA (2012)Google Scholar
  6. 6.
    Jiang, T., Mubayi, D., Tuza, Zs., Voloshin, V., West, D.: The chromatic spectrum of mixed hypergraphs. Graphs Combin. 18, 309–318 (2002)Google Scholar
  7. 7.
    Král, D.: On feasible sets of mixed hypergraphs. Electron. J. Combin. 11, #R19 (2004)Google Scholar
  8. 8.
    Král, D.: Mixed Hypergraphs and other coloring problems. Discrete Math. 307(7–8), 923–938 (2007)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    Kündgen, A., Mendelsohn, E., Voloshin, V.: Coloring of planar mixed hypergraphs. Electronic J. Combin. 7, #R60 (2000)Google Scholar
  10. 10.
    Voloshin, V.: On the upper chromatic number of a hypergraph. Australas. J. Combin. 11, 25–45 (1995)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Voloshin, V.: Coloring mixed hypergraphs: theory, algorithms and applications. AMS, Providence (2002)Google Scholar
  12. 12.
    Voloshin, V.: Mixed Hypergraph Coloring Web Site: http://spectrum.troy.edu/voloshin/mh.html
  13. 13.
    Zhao, P., Diao, K., Wang, K.: The smallest one-realization of a given set. Electron. J. Combin. 19, #P19 (2012)MathSciNetGoogle Scholar
  14. 14.
    Zhao, P., Diao, K., Wang, K.: The chromatic spectrum of 3-uniform bi-hypergraphs. Discrete Math. 311, 2650–2656 (2011)CrossRefMathSciNetzbMATHGoogle Scholar
  15. 15.
    Zhao, P., Diao, K., Chang, R., Wang, K.: The smallest one-realization of a given set II. Discrete Math. 312, 2946–2951 (2012)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Japan 2015

Authors and Affiliations

  1. 1.School of ScienceLinyi UniversityLinyiChina

Personalised recommendations