Bolyai Society Mathematical Studies

Fete of Combinatorics and Computer Science

Editors: Katona, Gyula, Schrijver, Alexander, Szönyi, Tamás (Eds.)

  • 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
see more benefits

Buy this book

eBook $149.00
price for USA (gross)
  • ISBN 978-3-642-13580-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $189.00
price for USA
  • ISBN 978-3-642-13579-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (14 chapters)

  • High Degree Graphs Contain Large-Star Factors

    Alon, Noga (et al.)

    Pages 9-21

  • Iterated Triangle Partitions

    Butler, Steve (et al.)

    Pages 23-42

  • PageRank and Random Walks on Graphs

    Chung, Fan (et al.)

    Pages 43-62

  • Solution of Peter Winkler’s Pizza Problem*†

    Cibulka, Josef (et al.)

    Pages 63-93

  • Tight Bounds for Embedding Bounded Degree Trees

    Csaba, Béla (et al.)

    Pages 95-137

Buy this book

eBook $149.00
price for USA (gross)
  • ISBN 978-3-642-13580-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $189.00
price for USA
  • ISBN 978-3-642-13579-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Fete of Combinatorics and Computer Science
Editors
  • Gyula Katona
  • Alexander Schrijver
  • Tamás Szönyi
Series Title
Bolyai Society Mathematical Studies
Series Volume
20
Copyright
2010
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
János Bolyai Mathematical Society and Springer-Verlag
eBook ISBN
978-3-642-13580-4
DOI
10.1007/978-3-642-13580-4
Hardcover ISBN
978-3-642-13579-8
Series ISSN
1217-4696
Edition Number
1
Number of Pages
VI, 361
Topics