Horizons of Combinatorics

ISBN: 978-3-540-77199-9 (Print) 978-3-540-77200-2 (Online)

Table of contents (13 chapters)

  1. Front Matter

    Pages 1-8

  2. No Access

    Book Chapter

    Pages 9-35

    Ballot Theorems, Old and New

  3. No Access

    Book Chapter

    Pages 37-66

    Statistical Inference on Random Structures

  4. No Access

    Book Chapter

    Pages 67-78

    Proof Techniques for Factor Theorems

  5. No Access

    Book Chapter

    Pages 79-103

    Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects

  6. No Access

    Book Chapter

    Pages 105-118

    Old and New Problems and Results in Ramsey Theory

  7. No Access

    Book Chapter

    Pages 119-140

    Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)

  8. No Access

    Book Chapter

    Pages 141-161

    Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube

  9. No Access

    Book Chapter

    Pages 163-177

    Combinatorial Conditions for the Rigidity of Tensegrity Frameworks

  10. No Access

    Book Chapter

    Pages 179-188

    Polygonal Graphs

  11. No Access

    Book Chapter

    Pages 189-213

    Infinite Combinatorics: From Finite to Infinite

  12. No Access

    Book Chapter

    Pages 215-234

    The Random Walk Method for Intersecting Families

  13. No Access

    Book Chapter

    Pages 235-255

    Problems and Results on Colorings of Mixed Hypergraphs

  14. No Access

    Book Chapter

    Pages 257-280

    Random Discrete Matrices