Topics in Discrete Mathematics

Dedicated to Jarik Nešetřil on the Occasion of his 60th Birthday

ISBN: 978-3-540-33698-3 (Print) 978-3-540-33700-3 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Algebra, Geometry, Numbers

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-11

      Countable Almost Rigid Heyting Algebras

    3. No Access

      Book Chapter

      Pages 13-37

      Piecewise-Bohr Sets of Integers and Combinatorial Number Theory

    4. No Access

      Book Chapter

      Pages 39-63

      A Generalization of Conway Number Games to Multiple Players

    5. No Access

      Book Chapter

      Pages 65-69

      Two Isoperimetric Problems for Euclidean Simplices

    6. No Access

      Book Chapter

      Pages 71-92

      On Finitely Generated Varieties of Distributive Double p-algebras and their Subquasivarieties

    7. No Access

      Book Chapter

      Pages 93-126

      The F-triangle of the Generalised Cluster Complex

  2. Ramsey Theory

    1. Front Matter

      Pages 127-127

    2. No Access

      Book Chapter

      Pages 129-132

      Monochromatic Equilateral Right Triangles on the Integer Grid

    3. No Access

      Book Chapter

      Pages 133-144

      One-sided Coverings of Colored Complete Bipartite Graphs

    4. No Access

      Book Chapter

      Pages 145-154

      Nonconstant Monochromatic Solutions to Systems of Linear Equations

    5. No Access

      Book Chapter

      Pages 155-167

      On the Induced Ramsey Number IR(P 3, H)

    6. No Access

      Book Chapter

      Pages 169-175

      On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products

  3. Graphs and Hypergraphs

    1. Front Matter

      Pages 177-177

    2. No Access

      Book Chapter

      Pages 179-213

      Hereditary Properties of Ordered Graphs

    3. No Access

      Book Chapter

      Pages 215-224

      A Proof and Generalizations of the Erdős-Ko-Rado Theorem Using the Method of Linearly Independent Polynomials

    4. No Access

      Book Chapter

      Pages 225-230

      Unions of Perfect Matchings in Cubic Graphs

    5. No Access

      Book Chapter

      Pages 231-246

      Random Graphs from Planar and Other Addable Classes

    6. No Access

      Book Chapter

      Pages 247-278

      Extremal Hypergraph Problems and the Regularity Method

  4. Homomorphisms

    1. Front Matter

      Pages 279-279

    2. No Access

      Book Chapter

      Pages 281-313

      Homomorphisms in Graph Property Testing

    3. No Access

      Book Chapter

      Pages 315-371

      Counting Graph Homomorphisms

    4. No Access

      Book Chapter

      Pages 373-405

      Efficient Algorithms for Parameterized H-colorings

    5. No Access

      Book Chapter

      Pages 407-432

      From Graph Colouring to Constraint Satisfaction: There and Back Again

previous Page of 2