Opendata, web and dolomites

LocalGlobal SIGNED

Local vs Global Properties of Large Discrete Structures

Total Cost €


EC-Contrib. €






Project "LocalGlobal" data sheet

The following table provides information about the project.


Organization address
address: RAMAT AVIV
city: TEL AVIV
postcode: 69978

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Israel [IL]
 Total cost 1˙684˙375 €
 EC max contribution 1˙684˙375 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2019-COG
 Funding Scheme ERC-COG
 Starting year 2021
 Duration (year-month-day) from 2021-03-01   to  2026-02-28


Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    TEL AVIV UNIVERSITY IL (TEL AVIV) coordinator 1˙684˙375.00


 Project objective

The PI proposes to study a variety of open problems in extremal combinatorics, an area that deals with the asymptotic relations between various parameters of large discrete structures. This area has grown tremendously in the past few decades, in depth and in breadth, and supplied many spectacular results that affected various other areas of mathematics, such as number theory, group theory, probability theory, information theory and theoretical computer science.

A common theme in many of the problems the PI will investigate is the relation between local and global properties of various discrete structures. For example, suppose a graph contains few copies of some fixed graph; what can one infer from this simple local restriction about other more global properties of this object? Perhaps surprisingly, many of the outstanding open problems in extremal combinatorics can be cast in this manner. One such problem is the celebrated hypergraph removal lemma. An important goal of this project is to obtain the first primitive recursive bounds for this fundamental problem. Another family of such problems are motivated by questions in theoretical computer science and ask to develop fast algorithms for deciding if a discrete structure satisfies some predetermined property. The PI will develop a unifying theory for such problems using various combinatorial tools introduced in the past few years. Another set of problems ask to establish that hypergraphs excluding certain types of sub-structures, possess surprisingly good Ramsey-type properties.

The common thread going through the above problems is Szemeredi's regularity lemma, which is one of the most powerful tools in extremal combinatorics. An important goal of this project is to find new applications of the graph and hypergraph versions this lemma, but more importantly, to develop new efficient variants of the lemma, tailored for specific applications, that would allow us to settle the problems discussed in this proposal.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "LOCALGLOBAL" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email ( and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "LOCALGLOBAL" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

NanoPD_P (2020)

High throughput multiplexed trace-analyte screening for diagnostics applications

Read More  


Dynamic Modeling of Labor Market Mobility and Human Capital Accumulation

Read More  

TALNET (2020)

Transparent Aluminium Networks

Read More