Fete of Combinatorics and Computer Science

1. High Degree Graphs Contain Large-Star Factors
Noga Alon, Nicholas Wormald

2. Iterated Triangle Partitions
Steve Butler, Ron Graham

3. PageRank and Random Walks on Graphs
Fan Chung, Wenbo Zhao

4. Solution of Peter Winkler’s Pizza Problem*†
Josef Cibulka, Rudolf Stolař, Jan Kynčl, Viola Mészáros, Pavel Valtr, Viola Mészáros

5. Tight Bounds for Embedding Bounded Degree Trees
Béla Csaba, Judit Nagy-György, Ian Levitt, Endre Szemerédi

6. Betti Numbers are Testable*
Gábor Elek

7. Rigid and Globally Rigid Graphs with Pinned Vertices
Tibor Jordán

8. Noise Sensitivity and Chaos in Social Choice Theory
Gil Kalai

9. Coloring Uniform Hypergraphs with Small Edge Degrees
Alexandr V. Kostochka, Vojtěch Rödl, Mohit Kumbhat

10. Extremal Graphs and Multigraphs with Two Weighted Colours
Edward Marchant, Andrew Thomason

11. Regularity Lemmas for Graphs
Vojtěch Rödl, Mathias Schacht

12. Edge Coloring Models as Singular Vertex Coloring Models
Balázs Szegedy

13. List Total Weighting of Graphs
Tsai-Lien Wong, Xuding Zhu, Daqing Yang

14. Open Problems
Noga Alon

Avainsanat: Mathematics, Combinatorics, Number Theory, Mathematics of Computing, Discrete Mathematics in Computer Science