Extremal Combinatorics :  With Applications in Computer  Science

This page will contain more detailed hints and/or solutions of exercises, as well as some new exercises.
The section will grow.
Additional topics (with applications of combinatorial methods in the theory of computing) can be found  here.

• More hints and solutions
  • 1.16
  • 1.17
  • 1.26
  • 2.8
  • 2.15
  • 4.16
  • 4.17
  • 9.4
  • 13.7
  • 13.12
  • 20.16
• More exercises
  • A Ramsey-type theorem for set intersections
  • Ramsey theorem for bipartite graphs
  • List chromatic number of bipartite graphs
  • Rich submatrices
  • Degree of induced subgraphs
  • Clique number of 4-cycle-free graphs
  • Zero-patterns of polynomials
  • Matrix rank and Ramsey graphs
  • Rank of generalized intersection matrices
  • Zeroes of multivariate polynomials
  • Nullstellensatz
  • Combinatorial Nullstellensatz
  • Regular subgraphs
  • The permanent lemma

All this in postscript format.