A First Course in Graph Theory and CombinatoricsThe Principle of Inclusion and Exclusion
A First Course in Graph Theory and Combinatorics: The Principle of Inclusion and Exclusion
Cioabă, Sebastian M.; Murty, M. Ram
2017-05-24 00:00:00
[The principle of inclusion-exclusion was used by De Moivre in 1718 to calculate the number of derangements on n elements.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-first-course-in-graph-theory-and-combinatorics-the-principle-of-FAx6BktVdR
A First Course in Graph Theory and CombinatoricsThe Principle of Inclusion and Exclusion
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.