Skip to main content
SpringerLink
Log in

Fete of Combinatorics and Computer Science

  • Book
  • © 2010

Overview

Editors:
  1. Gyula O. H. Katona

    1. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Alexander Schrijver

    1. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tamás Szőnyi

    1. Department of Computer Science, Eötvös University, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Gábor Sági

    1. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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

Part of the book series: Bolyai Society Mathematical Studies (BSMS, volume 20)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

  1. Front Matter

    Pages 1-8
    Download chapter PDF

  2. High Degree Graphs Contain Large-Star Factors

    • Noga Alon, Nicholas Wormald
    Pages 9-21

  3. Iterated Triangle Partitions

    • Steve Butler, Ron Graham
    Pages 23-42

  4. PageRank and Random Walks on Graphs

    • Fan Chung, Wenbo Zhao
    Pages 43-62

  5. Solution of Peter Winkler’s Pizza Problem*†

    • Josef Cibulka, Rudolf Stolař, Jan Kynčl, Viola Mészáros, Pavel Valtr, Viola Mészáros
    Pages 63-93

  6. Tight Bounds for Embedding Bounded Degree Trees

    • Béla Csaba, Judit Nagy-György, Ian Levitt, Endre Szemerédi
    Pages 95-137

  7. Betti Numbers are Testable*

    • Gábor Elek
    Pages 139-149

  8. Rigid and Globally Rigid Graphs with Pinned Vertices

    • Tibor Jordán
    Pages 151-172

  9. Noise Sensitivity and Chaos in Social Choice Theory

    • Gil Kalai
    Pages 173-212

  10. Coloring Uniform Hypergraphs with Small Edge Degrees

    • Alexandr V. Kostochka, Vojtěch Rödl, Mohit Kumbhat
    Pages 213-238

  11. Extremal Graphs and Multigraphs with Two Weighted Colours

    • Edward Marchant, Andrew Thomason
    Pages 239-286

  12. Regularity Lemmas for Graphs

    • Vojtěch Rödl, Mathias Schacht
    Pages 287-325

  13. Edge Coloring Models as Singular Vertex Coloring Models

    • Balázs Szegedy
    Pages 327-336

  14. List Total Weighting of Graphs

    • Tsai-Lien Wong, Xuding Zhu, Daqing Yang
    Pages 337-353

  15. Open Problems

    • Noga Alon
    Pages 355-365
Back to top

Keywords

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.

Editors and Affiliations

  • Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary

    Gyula O. H. Katona, Gábor Sági

  • Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

    Alexander Schrijver

  • Department of Computer Science, Eötvös University, Budapest, Hungary

    Tamás Szőnyi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation