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

From TCS Wiki
Jump to navigation Jump to search
Created page with "== Textbooks == {|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|100px |width="100%"| :J. H. van Lint and R. M. Wilson. ''A course in Combinatorics, 2nd Edition.'' Cambridge University Press, 2001. |- |border|100px|| :S. Jukna. ''Extremal Combinatorics: With Applications in Computer Science, 2nd Edition..."
 
Line 22: Line 22:
|-
|-
|[[File:Alon.jpeg|border|100px]]||
|[[File:Alon.jpeg|border|100px]]||
:N. Alon and J. H. Spencer. ''The Probabilistic Method, 3rd Edition.'' Wiley, 2008.
:N. Alon and J. H. Spencer. ''The Probabilistic Method, 4th Edition.'' Wiley, 2016.
|-
|-
|[[File:Lovasz-matching-theory.jpg|border|100px]]||
|[[File:Lovasz-matching-theory.jpg|border|100px]]||
: László Lovász and Michael D. Plummer. ''Matching Theory.'' American Mathematical Society, 2009.
: László Lovász and Michael D. Plummer. ''Matching Theory.'' American Mathematical Society, 2009.
|}
|}

Revision as of 05:18, 13 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, 2000.
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, 2nd Edition Springer, 2000.
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.