Skip to main content
Log in

A Simple Characterization of Proportionally 2-choosable Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We recently introduced proportional choosability, a new list analogue of equitable coloring. Like equitable coloring, and unlike list equitable coloring (a.k.a. equitable choosability), proportional choosability bounds sizes of color classes both from above and from below. In this note, we show that a graph is proportionally 2-choosable if and only if it is a linear forest such that its largest component has at most five vertices and all of its other components have two or fewer vertices. We also construct examples that show that characterizing equitably 2-choosable graphs is still open.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Erdős, P.: Problem 9, In: M. Fiedler, editor, Theory of Graphs and Its Applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159 (1964)

  2. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125–127 (1979)

    MATH  Google Scholar 

  3. Janson, S., Ruciński, A.: The infamous upper tail. Random Struct. Algorithms 20, 317–342 (2002)

    Article  MathSciNet  Google Scholar 

  4. Kaul, H., Jacobson, S.H.: New Global Optima Results for the Kauffman \(NK\) Model: Handling Dependency, Mathematical Programming, Special issue on ‘Optimization under Uncertainty’, Volume 108, 475–494 (2006)

  5. Kaul, H., Mudrock, J.A., Pelsmajer, M.J., Reiniger, B.: Proportional choosability: a new list analogue of equitable coloring, accepted in Discrete Mathematics

  6. Kierstead, H.A., Kostochka, A.V.: Equitable list coloring of graphs with bounded degree. J. Graph Theory 74, 309–334 (2013)

    Article  MathSciNet  Google Scholar 

  7. Kostochka, A.V.: Personal communication, (2018)

  8. Kostochka, A.V., Pelsmajer, M.J., West, D.B.: A list analogue of equitable coloring. J. Graph Theory 44, 166–177 (2003)

    Article  MathSciNet  Google Scholar 

  9. Li, Q., Bu, Y.: Equitable list coloring of planar graphs without 4- and 6-cycles. Discret. Math. 309, 280–287 (2009)

    Article  MathSciNet  Google Scholar 

  10. Meyer, W.: Equitable coloring. Am. Math. Monthly 80, 920–922 (1973)

    Article  MathSciNet  Google Scholar 

  11. Mudrock, J.: On the list coloring problem and its equitable variants, Ph.D. Thesis, Illinois Institute of Technology, (2018)

  12. Mudrock, J.: Proportional choosability: a new list analogue of equitable coloring, talk presented at the University of Illinois at Urbana-Champaign Graph Theory and Combinatorics Seminar February 2018, Urbana, IL

  13. Pemmaraju, S.V.: Equitable colorings extend Chernoff-Hoeffding bounds, Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001), 285–296 (2001)

  14. Tucker, A.: Perfect graphs and an application to optimizing municipal services. SIAM Rev. 15, 585–590 (1973)

    Article  MathSciNet  Google Scholar 

  15. Vizing, V.G.: Coloring the vertices of a graph in prescribed colors, Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem 101, 3–10 (1976)

  16. Wang, W., Lih, K.: Equitable list coloring of graphs. Taiwan. J. Math. 8(4), 747–759 (2004)

    Article  MathSciNet  Google Scholar 

  17. West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

  18. Zhang, X., Wu, J.-L.: On equitable and equitable list colorings of series–parallel graphs. Discret. Math. 311, 800–803 (2011)

    Article  MathSciNet  Google Scholar 

  19. Zhu, J., Bu, Y.: Equitable list coloring of planar graphs without short cycles. Theor. Comput. Sci. 407, 21–28 (2008)

    Article  MathSciNet  Google Scholar 

  20. Zhu, J., Bu, Y.: Equitable and equitable list colorings of graphs. Theor. Comput. Sci. 411, 3873–3876 (2010)

    Article  MathSciNet  Google Scholar 

  21. Zhu, J., Bu, Y., Min, X.: Equitable list-coloring for \(C_5\)-free plane graphs without adjacent triangles. Gr. Comb. 31, 795–804 (2015)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees whose comments helped improve the readability of this note.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeffrey A. Mudrock.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kaul, H., Mudrock, J.A., Pelsmajer, M.J. et al. A Simple Characterization of Proportionally 2-choosable Graphs. Graphs and Combinatorics 36, 679–687 (2020). https://doi.org/10.1007/s00373-020-02146-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02146-z

Keywords

Mathematics Subject Classification

Navigation