组合数学 (Spring 2023)/Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
 
(One intermediate revision by the same user not shown)
Line 11: Line 11:
== References ==
== References ==
{|border="2"  cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;"
{|border="2"  cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;"
|[[File:Stanley.jpg|border|100px]]
|[[File:Stanley-2e.jpg|border|100px]]
|width="100%"|
|width="100%"|
:R. Stanley. ''Enumerative Combinatorics, Volume 1, 2nd Edition.'' Cambridge University Press, 2000.
:R. Stanley. ''Enumerative Combinatorics, Volume 1, 2nd Edition.'' Cambridge University Press, 2011.
|-
|-
|[[File:Graham.jpg|border|100px]]||
|[[File:Graham.jpg|border|100px]]||

Latest revision as of 10:26, 16 February 2023

Textbooks

J. H. van Lint and R. M. Wilson. A course in Combinatorics, 2nd Edition. Cambridge University Press, 2001.
S. Jukna. Extremal Combinatorics: With Applications in Computer Science, 2nd Edition. Springer, 2011.

References

R. Stanley. Enumerative Combinatorics, Volume 1, 2nd Edition. Cambridge University Press, 2011.
R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science, 2nd Edition. Addison-Wesley, 1994.
Martin Aigner, and Gunter M. Ziegler. Proofs from THE BOOK, 6th Edition Springer, 2018.
N. Alon and J. H. Spencer. The Probabilistic Method, 4th Edition. Wiley, 2016.
László Lovász and Michael D. Plummer. Matching Theory. American Mathematical Society, 2009.