Abstract: Quasi-random objects are deterministic objects that poses properties one expects to find in "truly" random ones. The study of such objects lies at the intersection of many areas such as graph theory, additive number theory and theoretical computer science. I will start by giving an overview of this topic, mentioning some classic results. I will then turn to some recent joint works with Subrahmanyam Kalyanasundaram.

No prior knowledge in graph theory will be assumed

Coffee will be served at 12:00 before the lecture
at Schreiber building 006