Educational Workshop in the framework of

Today random methods, ("random and semirandom constructions") the investigation of typical random structures or (more recently) quasirandom structures are in the forefront of modern combinatorics. Systematic application of random methods in combinatorics came originally from Paul Erdős. In the early 70's the investigation of typical random structures became an important field in combinatorics and graph theory. Approximating any structure by randomlooking structures, e.g. via the Szemerédi Regularity lemma became one of the most powerful methods in combinatorics. This and many connections to Theoretical Computer Science (random codes, already in Shannon's codes, looking for constructively given Ramsey graphs, use of expanders, etc) led also to an extensive theory of quasirandom structures. (Pseudorandom numbers are extremely important in computer science, e.g., in Monte Carlo methods. However, our main topics are related to structures like graphs, hypergraphs, integers,... )