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 ofmathematics. 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. Fields of science natural sciencescomputer and information sciencescomputational sciencenatural sciencesmathematicspure mathematicsdiscrete mathematicsgraph theorynatural sciencesmathematicspure mathematicsdiscrete mathematicscombinatorics Programme(s) FP7-PEOPLE - Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) Topic(s) FP7-PEOPLE-2011-CIG - Marie-Curie Action: "Career Integration Grants" Call for proposal FP7-PEOPLE-2011-CIG See other projects for this call Funding Scheme MC-CIG - Support for training and career development of researcher (CIG) Coordinator TEL AVIV UNIVERSITY Address Ramat aviv 69978 Tel aviv Israel See on map Activity type Higher or Secondary Education Establishments Administrative Contact Lea Pais (Ms.) Links Contact the organisation Opens in new window Website Opens in new window EU contribution No data
