Logo - springer
Slogan - springer

New & Forthcoming Titles | Fete of Combinatorics and Computer Science

Fete of Combinatorics and Computer Science

Katona, Gyula O.H., Schrijver, Alexander, Szönyi, Tamás (Eds.)

2010, 365 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-13580-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-13579-8

free shipping for individuals worldwide

online orders shipping within 2-3 days.

add to marked items

  • Provides a collection of outstanding articles on discrete mathematics and theoretical computer science
  • Based on the contributions to Laszlo Lovasz's 60th anniversary
  • Offers a discussion of state-of-the-art combinatorics and related topics
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.

Content Level » Graduate

Keywords » Combinatorics - Graph - Graphs, Hypergraphs - Hypergraph - Partition - Random Structures - Set Theory - Vertices

Related subjects » Mathematics - Number Theory and Discrete Mathematics - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics.