1. Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125–134 (1992)
2. Atserias, A., Bonacina, I., de Rezende, S.F., Lauria, M., Nordström, J., Razborov, A.A.: Clique is hard on average for regular resolution. In: Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2008) (2018, to appear)
3. Atserias, A., Ochremiak, J.: Proof complexity meets algebra. In: ICALP 2017. Leibniz International Proceedings in Informatics (LIPIcs), vol. 80, pp. 110:1–110:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2017)
4. Bayer, D.A.: The division algorithm and the Hilbert scheme. Ph.D. thesis, Harvard University, Cambridge, MA, USA, June 1982. https://www.math.columbia.edu/~bayer/papers/Bayer-thesis.pdf
5. Beame, P., Culberson, J.C., Mitchell, D.G., Moore, C.: The resolution complexity of random graph $$k$$-colorability. Discrete Appl. Math. 153(1–3), 25–47 (2005)