Fete of Combinatorics and Computer Science: Bolyai Society Mathematical Studies, cartea 20
Editat de Gyula O. H. Katona, Alexander Schrijver, Tamás Szönyien Limba Engleză Paperback – 25 oct 2016
Din seria Bolyai Society Mathematical Studies
-
Preț: 386.89 lei - 20%
Preț: 528.06 lei - 24%
Preț: 1981.88 lei - 15%
Preț: 630.60 lei - 18%
Preț: 756.38 lei - 15%
Preț: 635.48 lei - 15%
Preț: 624.70 lei - 15%
Preț: 613.71 lei - 15%
Preț: 620.86 lei - 20%
Preț: 616.23 lei - 15%
Preț: 614.61 lei - 15%
Preț: 635.80 lei - 15%
Preț: 629.24 lei - 15%
Preț: 629.97 lei - 20%
Preț: 632.28 lei - 24%
Preț: 912.08 lei - 15%
Preț: 628.15 lei -
Preț: 378.71 lei - 18%
Preț: 1093.26 lei - 18%
Preț: 712.54 lei - 15%
Preț: 636.14 lei - 15%
Preț: 681.10 lei - 18%
Preț: 757.40 lei
Preț: 619.66 lei
Preț vechi: 729.01 lei
-15%
Puncte Express: 929
Carte tipărită la comandă
Livrare economică 08-22 iunie
Specificații
ISBN-13: 9783662506424
ISBN-10: 3662506424
Pagini: 368
Ilustrații: VI, 361 p.
Dimensiuni: 170 x 244 x 20 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 2010
Editura: Springer
Colecția Bolyai Society Mathematical Studies
Seria Bolyai Society Mathematical Studies
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662506424
Pagini: 368
Ilustrații: VI, 361 p.
Dimensiuni: 170 x 244 x 20 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 2010
Editura: Springer
Colecția Bolyai Society Mathematical Studies
Seria Bolyai Society Mathematical Studies
Locul publicării:Berlin, Heidelberg, Germany
Cuprins
High Degree Graphs Contain Large-Star Factors.- Iterated Triangle Partitions.- PageRank and Random Walks on Graphs.- Solution of Peter Winkler’s Pizza Problem*†.- Tight Bounds for Embedding Bounded Degree Trees.- Betti Numbers are Testable*.- Rigid and Globally Rigid Graphs with Pinned Vertices.- Noise Sensitivity and Chaos in Social Choice Theory.- Coloring Uniform Hypergraphs with Small Edge Degrees.- Extremal Graphs and Multigraphs with Two Weighted Colours.- Regularity Lemmas for Graphs.- Edge Coloring Models as Singular Vertex Coloring Models.- List Total Weighting of Graphs.- Open Problems.
Caracteristici
Collection of outstanding articles on discrete mathematics and theoretical computer science Based on the contributions to Laszlo Lovasz's 60th anniversary Offers an excellent view on the state of combinatorics and related topics