Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Third Edition)
World Scientific Publishing Co Pte Ltd (Verlag)
978-981-4460-00-2 (ISBN)
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.
Erscheint lt. Verlag | 10.5.2011 |
---|---|
Verlagsort | Singapore |
Sprache | englisch |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
ISBN-10 | 981-4460-00-1 / 9814460001 |
ISBN-13 | 978-981-4460-00-2 / 9789814460002 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich