Fete of Combinatorics and Computer Science [This book is the second volume of mathematical papers to commemorate the 60th birthday of László ('Laci ') Lovász on March 9, 2008 ... two conferences were organized , the first from 5-9 August 2008 in Budape

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 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: Front Matter....Pages 1-8 High Degree Graphs Contain Large-Star Factors....Pages 9-21 Iterated Triangle Partitions....Pages 23-42 PageRank and Random Walks on Graphs....Pages 43-62 Solution of Peter Winkler’s Pizza Problem*� ....Pages 63-93 Tight Bounds for Embedding Bounded Degree Trees....Pages 95-137 Betti Numbers are Testable*....Pages 139-149 Rigid and Globally Rigid Graphs with Pinned Vertices....Pages 151-172 Noise Sensitivity and Chaos in Social Choice Theory....Pages 173-212 Coloring Uniform Hypergraphs with Small Edge Degrees....Pages 213-238 Extremal Graphs and Multigraphs with Two Weighted Colours....Pages 239-286 Regularity Lemmas for Graphs....Pages 287-325 Edge Coloring Models as Singular Vertex Coloring Models....Pages 327-336 List Total Weighting of Graphs....Pages 337-353 Open Problems....Pages 355-365