ENGLISH

A walk through combinatorics. An introduction to enumeration and graph theory

By Stanley , Miklós , Richard P.; Bóna

Book information

Publisher
World Scientific
Year
2011
ISBN
978-981-4335-23-2, 981-4335-23-1, 9789814460002, 9814460001
Language
english
Format
PDF
Filesize
2 MB (2308675 bytes)
Edition
3rd ed., reprinted
Pages
550\556
Library
kolxo3
Time added
2019-04-25 18:00:00
matematika -- kombinatorika -- preštevanja -- teo

Description

Content: Basic Methods Seven is More Than Six. The Pigeon-Hole Principle One Step at a Time. The Method of Mathematical Induction Enumerative Combinatorics There are a Lot of Them. Elementary Counting Problems No Matter How You Slice It. The Binomial Theorem and Related Identities Divide and Conquer. Partitions Not So Vicious Cycles. Cycles in Permutations You Shall Not Overcount. The Sieve A Function is Worth Many Numbers. Generating Functions Graph Theory Dots and Lines. The Origins of Graph Theory Staying Connected. Trees Finding a Good Match. Coloring and Matching Do Not Cross. Planar Graphs Horizons Does It clique? Ramsey Theory So Hard to Avoid. Subsequence Conditions on Permutations Who Knows What It Looks Like, But It Exists. The Probabilistic Method At Least Some Order. Partial Orders and Lattices As Evenly as Possible. Block Designs and Error Correcting Codes Are They Really Different? Counting Unlabeled Structures The Sooner the Better. Combinatorial Algorithms Does Many Mean More Than One? Computational Complexity.

Similar books