Fete of Combinatorics and Computer Science

ISBN: 978-3-642-13579-8 (Print) 978-3-642-13580-4 (Online)

Table of contents (14 chapters)

  1. Front Matter

    Pages 1-8

  2. No Access

    Book Chapter

    Pages 9-21

    High Degree Graphs Contain Large-Star Factors

  3. No Access

    Book Chapter

    Pages 23-42

    Iterated Triangle Partitions

  4. No Access

    Book Chapter

    Pages 43-62

    PageRank and Random Walks on Graphs

  5. No Access

    Book Chapter

    Pages 63-93

    Solution of Peter Winkler’s Pizza Problem*†

  6. No Access

    Book Chapter

    Pages 95-137

    Tight Bounds for Embedding Bounded Degree Trees

  7. No Access

    Book Chapter

    Pages 139-149

    Betti Numbers are Testable*

  8. No Access

    Book Chapter

    Pages 151-172

    Rigid and Globally Rigid Graphs with Pinned Vertices

  9. No Access

    Book Chapter

    Pages 173-212

    Noise Sensitivity and Chaos in Social Choice Theory

  10. No Access

    Book Chapter

    Pages 213-238

    Coloring Uniform Hypergraphs with Small Edge Degrees

  11. No Access

    Book Chapter

    Pages 239-286

    Extremal Graphs and Multigraphs with Two Weighted Colours

  12. No Access

    Book Chapter

    Pages 287-325

    Regularity Lemmas for Graphs

  13. No Access

    Book Chapter

    Pages 327-336

    Edge Coloring Models as Singular Vertex Coloring Models

  14. No Access

    Book Chapter

    Pages 337-353

    List Total Weighting of Graphs

  15. No Access

    Book Chapter

    Pages 355-365

    Open Problems