Here are a few papers: Donald E. Knuth, Permutations, matrices, and generalized Young tableaux, Pacific J. Math. Volume 34, Number 3 (1970), 709-727. http://projecteuclid.org/euclid.pjm/1102971948 and other papers of D. Knuth on Discrete Mathematics: http://www-cs-faculty.stanford.edu/~uno/dm.html C. Schensted, Longest increasing and decreasing subsequences, Canadian Journal of Mathemetics 13 (1961), 179-191. https://cms.math.ca/10.4153/CJM-1961-015-3 Curtis Greene, Daniel J Kleitman, Strong versions of Sperner's theorem, Journal of Combinatorial Theory, Series A Volume 20, Issue 1, (1976), 80-88. http://www.sciencedirect.com/science/article/pii/0097316576900790 F. E. Su, Rental harmony: Sperner's lemma in fair division, Amer. Math. Monthly, 106(1999), 930-942. https://www.math.hmc.edu/~su/papers.dir/rent.pdf Ira M. Gessel, Xavier G. Viennot, Determinants, Paths and Plane Partitions, (1989). http://contscience.xavierviennot.org/xavier/articles_files/determinant_89.pdf C. Greene, A. Nijenhuis, H. S. Wilf, A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math. 31, (1979) 104-109. S.Fomin, A.Zelevinsky, Total positivity: tests and parametrizations, Math. Intelligencer 22 (2000), 23-33. http://arxiv.org/abs/math/9912128 The above papers are just suggestions. You can make a presentation based on your own favorite research paper on discrete math. You can check the following sources: - preprints of recent papers: arxiv.org, in particular http://arxiv.org/list/math.CO/recent - the Electronic Journal of Combinatorics: http://www.combinatorics.org/ojs/index.php/eljc/issue/current - Journal of Combinatorial Theory, Series A: http://www.journals.elsevier.com/journal-of-combinatorial-theory-series-a/ - Discrete Mathematics: http://www.journals.elsevier.com/discrete-mathematics/