Skip to main content

Extremal Problems in Combinatorics and Their Applications

Objective

In this proposal we describe a variety of problems in Extremal Combinatorics which we intend to study. These problems belong to the following two areas:

1. Additive Combinatorics: We intend to investigate different aspects of Green's variant of the classical Removal Lemma from Graph Theory.
Besides being a fundamental problem, we have recently shown that certain variants of Green's result have applications in Theoretical Computer Science. We are working on extending this work to more general settings with the hope of resolving several open problems.

2. Quasi-Randomness: The theory of Quasi-Randomness is one of the most interesting ways in which combinatorics interacts with other areas of
mathematics. The main goal is to come up with conditions under which deterministic structures behave like random ones. This concept turned out to be extremely useful for tackling a variety of open problems in different areas. We intend to consider several problem related to graphs and hypergraphs and to further extend this theory.

Call for proposal

FP7-PEOPLE-2011-CIG
See other projects for this call

Coordinator

TEL AVIV UNIVERSITY
Address
Ramat Aviv
69978 Tel Aviv
Israel
Activity type
Higher or Secondary Education Establishments
EU contribution
€ 100 000
Administrative Contact
Lea Pais (Ms.)