Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano it
CORDIS - Risultati della ricerca dell’UE
CORDIS
Contenuto archiviato il 2024-06-18

Extremal Problems in Combinatorics and Their Applications

Obiettivo

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.

Campo scientifico (EuroSciVoc)

Argomento(i)

Invito a presentare proposte

FP7-PEOPLE-2011-CIG
Vedi altri progetti per questo bando

Meccanismo di finanziamento

MC-CIG - Support for training and career development of researcher (CIG)

Coordinatore

TEL AVIV UNIVERSITY
Contributo UE
€ 100 000,00
Costo totale
Nessun dato