PECTA (303320)

  https://cordis.europa.eu/project/id/303320

  FP7 (2007-2013)

  Extremal Problems in Combinatorics and Their Applications

  Marie-Curie Action: "Career Integration Grants" (FP7-PEOPLE-2011-CIG)

  computational science  ·  graph theory  ·  combinatorics

  2012-04-01 Start Date (YY-MM-DD)

  2016-03-31 End Date (YY-MM-DD)

  € 100,000 Total Cost

  Description

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.

  Complicit Organisations

1 Israeli organisation participates in PECTA.