Cantitate/Preț
Produs

Fete of Combinatorics and Computer Science: Bolyai Society Mathematical Studies, cartea 20

Editat de Gyula O. H. Katona, Alexander Schrijver, Tamás Szönyi
en Limba Engleză Hardback – 16 iul 2010
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 61966 lei  6-8 săpt.
  Springer – 25 oct 2016 61966 lei  6-8 săpt.
Hardback (1) 63209 lei  38-45 zile
  SPRINGER VIEWEG – 16 iul 2010 63209 lei  38-45 zile

Din seria Bolyai Society Mathematical Studies

Preț: 63209 lei

Preț vechi: 79011 lei
-20%

Puncte Express: 948

Preț estimativ în valută:
11176 13166$ 9745£

Carte tipărită la comandă

Livrare economică 06-13 aprilie


Specificații

ISBN-13: 9783642135798
ISBN-10: 364213579X
Pagini: 372
Ilustrații: VI, 361 p.
Dimensiuni: 174 x 243 x 26 mm
Greutate: 0.79 kg
Ediția:2010
Editura: SPRINGER VIEWEG
Colecția Bolyai Society Mathematical Studies
Seria Bolyai Society Mathematical Studies

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Graduate

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