Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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 [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.png

A First Course in Graph Theory and CombinatoricsThe Principle of Inclusion and Exclusion

Loading next page...
 
/lp/springer-journals/a-first-course-in-graph-theory-and-combinatorics-the-principle-of-FAx6BktVdR

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Hindustan Book Agency
Copyright
© Hindustan Book Agency (India) 2009
ISBN
978-81-85931-98-2
Pages
24 –32
DOI
10.1007/978-93-86279-39-2_3
Publisher site
See Chapter on Publisher Site

Abstract

[The principle of inclusion-exclusion was used by De Moivre in 1718 to calculate the number of derangements on n elements.]

Published: May 24, 2017

There are no references for this article.