A Walk Through Combinatorics

en Limba Engleză Hardback – 8 mai 2011

Suitable for an introductory combinatorics course lasting one or two semesters, this book includes an extensive list of problems, ranging from routine exercises to research questions. It walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some the progress made in the area.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Hardback (2)	624^.94 lei 6-8 săpt.
WORLD SCIENTIFIC – 8 mai 2011	624^.94 lei 6-8 săpt.
World Scientific Publishing Company – 30 sep 2006	763^.08 lei 6-8 săpt.

Preț: 624^.94 lei

Preț vechi: 735^.22 lei
-15% Nou

Puncte Express: 937

:
119^.68€ • 129^.22$ • 99^.68£

Carte tipărită la comandă

Livrare economică 06-20 decembrie

Adaugă în coș

Wish list
Gift list
Am citit!

Adaugă în listă

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789814335232
ISBN-10: 9814335231
Pagini: 546
Ilustrații: Illustrations
Dimensiuni: 155 x 231 x 33 mm
Greutate: 0.95 kg
Ediția:3 Rev ed.
Editura: WORLD SCIENTIFIC

Cuprins

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; The Sooner The Better. Combinatorial Algorithms; Does Many Mean More Than One? Computational Complexity.

Recenzii

Bona's book is an excellent choice for anyone who wants an introduction to this beautiful branch of mathematics ... Plentiful examples illustrate each of the topics included in the book. Bona does a supreme job of walking us through combinatorics."Choice

Papetărie, jocuri, reviste