Research Seminar in Combinatorics - 0366-4939-01

Sunday, Schreiber 309, starting 10am

The seminar will consist of presentations by visitors and by locals, focusing on various topics in Combinatorics and their applications in Theoretical Computer Science. This is a research seminar, and the program of each week will be sent via email to those interested, and will be posted in this web page.

Sunday, starting 10:05, Schreiber building, Room 309.

- Feb 16: Danny Vilenchik (Weiznamm): Chasing the k-colorability threshold
- Feb. 23: Shay Moran (Technion): Shattering and Graph Orientations
- March 2: Asaf Ferber (ETH Zurich): Universality of random graphs and rainbow embedding
- March 9: Gregory Freiman (Tel Aviv U.): An exact volume estimate for sets of integers with a given doubling constant
- March 16: PURIM
- March 23: Simi Haber (Bar Ilan U.): First order properties of random geometric graphs
- March 30: Oren Becker (Hebrew University): Families of Cayley graphs which are unique-neighbor expanders
- April 6: Gregory Z. Gutin (Royal Holloway, University of London): Planning for Snow Plowing in Berlin: Parameterized Rural Postman Problem
- April 13, 20: PASSOVER
- April 27: Tibor Szabo (Berlin): What is Ramsey-equivalent to a clique?
- May 4: Deepak Rajendraprasad (U. of Haifa): Separation dimension of hypergraphs
- May 11: Ilan Newman (U. of Haifa): The combinatorics of simplicial complexes as a high dimensional analog of Graphs
- May 18: Alon Naor (Tel Aviv U.): Saturation games
- May 25: Moshe Rosenfeld (Seattle): The odd-distance graph
- June 1: Uri Zwick (Tel Aviv U.): Adjacency labeling schemes and induced-universal graphs
- June 8: Benny Sudakov (ETH): Grid Ramsey problem and related questions