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)
3. Janson, S., Ruciński, A.: The infamous upper tail. Random Struct. Algorithms 20, 317–342 (2002)
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