Cantitate/Preț
Produs
Total produse
Vezi coșul
WALK THROUGH COMBINATORICS (3ED) de Bona Miklos

WALK THROUGH COMBINATORICS (3ED)

Autor Bona Miklos
en Limba Engleză Hardback – 9 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

Toate formatele și edițiile Preț Express
Paperback (1) 40884 lei  6-8 săpt. +7115 lei  6-12 zile
  World Scientific – 9 mai 2011 40884 lei  6-8 săpt. +7115 lei  6-12 zile
Hardback (1) 63475 lei  6-8 săpt.
  World Scientific – 9 mai 2011 63475 lei  6-8 săpt.

Preț: 63475 lei

Preț vechi: 74676 lei
-15%

Puncte Express: 952
Preț estimativ în valută:
11224€ • 13233$ • 9687£

Carte tipărită la comandă

Livrare economică 19 martie-02 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9789814335232
ISBN-10: 9814335231
Pagini: 570
Ilustrații: Illustrations
Dimensiuni: 157 x 235 x 35 mm
Greutate: 0.97 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; 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.