895
Bibliography
[1] Martin Aigner and Gunter M. ̈ Proofs from The Book. Springer-Verlag, 1999.
MR1723092. 4, 19
[2] Eric Bach and Jeffrey Shallit.Efficient Algorithms, volume 1 ofAlgorithmic
Number Theory. The MIT Press, 1996. 282
[3] Edward A. Bender and S. Gill Williamson.A Short Course in Discrete Math-
ematics. Dover Publications, 2005.
[4] Arthur T. Benjamin and Jennifer J. Quinn.Proofs That Really Count: The Art
of Combinatorial Proof. The Mathematical Association of America, 2003.
502, 591
[5] P. J. Bickel1, E. A. Hammel1, and J. W. O’Connell1. Sex bias in graduate
admissions: Data from berkeley.Science, 187(4175):398–404, 1975. 712
[6] Norman L. Biggs. Discrete Mathematics. Oxford University Press, second
edition, 2002.
[7] Bela Bollob ́ ́as. Modern Graph Theory, volume 184 ofGraduate Texts in
Mathematics. Springer-Verlag, 1998. MR1633290. 433
[8] Miklos B ́ ona. ́ Introduction to Enumerative Combinatorics. Walter Rudin
Student Series in Advanced Mathematics. McGraw Hill Higher Education,
- MR2359513. 502, 591, 646
[9] Timothy Y. Chow. The surprise examination or unexpected hanging paradox.
American Mathematical Monthly, pages 41–51, 1998.
[10] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford
Stein.Introduction to Algorithms. The MIT Press, third edition, 2009.
[11] Antonella Cupillari. The Nuts and Bolts of Proofs. Academic Press, fourth
edition, 2012. MR1818534. 4, 19
[12] Reinhard Diestel.Graph Theory. Springer-Verlag, second edition, 2000. 433
[13] Michael Patersonet al. Maximum overhang. MAA Monthly, 116:763–787,
- 520
[14] Shimon Even.Algorithmic Combinatorics. Macmillan, 1973. 591