Publisher
Springer International Publishing
Reference26 articles.
1. Aigner, M., Ziegler, G.M.: Proofs from THE BOOK. Springer Berlin, Heidelberg, 6th edn. (2018), chapter 30: Three famous theorems on finite sets. https://doi.org/10.1007/978-3-662-57265-8
2. Borgersen, R.D.: Equivalence of seven major theorems in combinatorics (2004), talk available at Department of Mathematics, University of Manitoba, Canada. https://home.cc.umanitoba.ca/~borgerse/Presentations/GS-05R-1.pdf
3. Braselmann, P., Koepke, P.: Gödel’s completeness theorem. Formalized Math. (University of Białystok) 13(1), 49–53 (2005). https://fm.mizar.org/2005-13/pdf13-1/goedelcp.pdf
4. Cameron, P.J.: Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge (1994)
5. De Bruijn, N.G., Erdös, P.: A colour problem for infinite graphs and a problem in the theory of relations. Indagationes Mathematicae (Proceedings) 54, 371–373 (1951). https://doi.org/10.1016/S1385-7258(51)50053-7