Fete of Combinatorics and Computer Science

1. Front Matter

   Pages 1-8

   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

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.

• Combinatorics
• Graph
• Graphs, Hypergraphs
• Hypergraph
• Partition
• Random Structures
• Set Theory
• Vertices

• 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

Policies and ethics