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

CHROMPART

Financiado

Cerrado

Partition calculus on graphs digraphs and hypergraphs with uncountable chromati...

Partition calculus on graphs digraphs and hypergraphs with uncountable chromatic number Our main goal is to develop the theory of partition calculus on graphs, digraphs and hypergraphs with emphasis on interactions between one-and multi-dimensional relations. Such global characteristics crucially depend on local, oft... ver más

28/02/2022

UEA

225K€

Presupuesto del proyecto: 225K€

Líder del proyecto

UNIVERSITY OF EAST ANGLIA 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.

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2022-02-28

MSCA-IF-2018: Individual Fellowships

I+D

Cerrada hace 6 años

0% 100%

Información adicional privada

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

1 Participantes

UEA

224.93K€ | Lider

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

PROBCOMB Sparse Discrete Structures 119K€ Cerrado

RandomHypGra Concentration and threshold phenomena in random graphs and h... 2M€ Cerrado

LASTING LArge STructures IN random Graphs 225K€ Cerrado

GeoScape From Geometry to Combinatorics and Back Escaping the Curse... 2M€ Cerrado

PROGEOCOM Avenues in Probabilistic and Geometric Combinatorics 1M€ Cerrado

RANDSTRUCT Randomness and structure in combinatorics 1M€ Cerrado

Duración del proyecto: 34 meses Fecha Inicio: 2019-04-15
Fecha Fin: 2022-02-28

Líder del proyecto

UNIVERSITY OF EAST ANGLIA No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 225K€

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

Descripción del proyecto Our main goal is to develop the theory of partition calculus on graphs, digraphs and hypergraphs with emphasis on interactions between one-and multi-dimensional relations. Such global characteristics crucially depend on local, often finitary structural properties. This places our project at the meeting point of finite and infinite combinatorics with logic and set theory. Some of the most important questions that motivate our investigations were first raised by P. Erdős and A. Hajnal in the 1960s. Their problems still guide research across finite and infinite combinatorics including the most recent works of R. Diestel, N. Hindman, P. Komjáth, C. Thomassen, S. Todorcevic, and S. Shelah. Our main objective is to investigate ramification arguments between Ramsey-results of varying dimensions. In fact, (1) we study if graphs with uncountable chromatic number necessarily satisfy the same higher-dimensional negative partition relations as uncountable complete graphs. We relate this theme to (2) the existence of orientations with large dichromatic number and partition relations on digraphs. Lastly, we explore a novel concept, (3) the existence of oscillation maps on the obligatory hypergraph associated to a graph with uncountable chromatic number. Our program will be carried out through solving specific, often well-known open problems that are central to these themes. We aim to study both the purely combinatorial and the deep foundational issues that underlie these questions. Hence, we will complement the use of advanced forcing techniques from set theory (such as mixed side-condition methods and new iteration preservation theorems) with novel combinatorial tools, such as minimal walks, oscillation maps and various ZFC construction scheme techniques. We expect our research to produce new methods of wide impact and a significantly deeper understanding of the interactions of finite and infinitary combinatorics.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores