Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

GeoScape

Financiado

Cerrado

From Geometry to Combinatorics and Back Escaping the Curse of Dimensionality

"Combinatorics is a fundamental mathematical discipline whose study has experienced unprecedented growth during the past few decades. Its rapid development can be partially explained by spectacular applications of extremal combina... ver más

28/02/2026

HUN-REN ALFRED REN...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

HUNREN RENYI ALFRED MATEMATIKAI KUTATOINTEZET No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2020-08-17

ERC-2019-ADG: ERC Advanced Grant

I+D

Cerrada hace 5 años

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

2 Participantes

HUN-REN ALFRED RENYI INSTITU...

2.01M€ | Lider

ARNEPLANT

189.69K€ | Participante

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

LASTING LArge STructures IN random Graphs 225K€ Cerrado

PROBCOMB Sparse Discrete Structures 119K€ Cerrado

HI-DIM COMBINATORICS High dimensional combinatorics 2M€ Cerrado

BORCA Borel combinatorics and Approximations 179K€ Cerrado

PEPCo Problems in Extremal and Probabilistic Combinatorics 2M€ Cerrado

EXTPRO Quasi Randomness in Extremal Combinatorics 1M€ Cerrado

Duración del proyecto: 66 meses Fecha Inicio: 2020-08-17
Fecha Fin: 2026-02-28

Líder del proyecto

HUNREN RENYI ALFRED MATEMATIKAI KUTATOINTEZET No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto "Combinatorics is a fundamental mathematical discipline whose study has experienced unprecedented growth during the past few decades. Its rapid development can be partially explained by spectacular applications of extremal combinatorics in additive number theory, information theory, theoretical computer science, and elsewhere. Asymptotic results in extremal and probabilistic combinatorics have proved to be powerful tools in the structural and algorithmic analysis of huge networks such as the internet graph, brain maps, social networks, and integrated circuits. We have deep, well developed algebraic, topological, and probabilistic techniques to tackle some basic problems of modern combinatorics, but many classic Ramsey-, Turán-, and Szemerédi-type questions remained open. The main goal of the proposed work is to attack some hard problems for large classes of graphs and hypergraphs arising in geometric, algebraic, and practical applications. These structures escape the ""curse of dimensionality: they can be embedded in a bounded-dimensional space, or they have small VC-dimension, or a short algebraic description. The work of the principal investigator, his collaborators and students has played a significant role in the introduction of modern combinatorial tools in geometry. In the present project, he aims to explore the reverse direction: to develop and apply geometric techniques to settle important special cases of notoriously difficult combinatorial problems on (1) bounded degree semi-algebraic graphs and hypergraphs, (2) graphs and hypergraph of bounded VC-dimension, (3) ordered graphs, 0-1 matrices, and graphs embedded in the plane or in other surfaces. Progress on the problems described in the proposal is expected to lead closer to the solution of some classical problems such as the Erdős-Hajnal conjecture, the Danzer-Rogers conjecture, the Schur-Erdős problem, and to the development of improved algorithms for clustering and property testing in huge graphs."

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores