Opendata, web and dolomites

CHROMPART

Partition calculus on graphs, digraphs and hypergraphs with uncountable chromatic number

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "CHROMPART" data sheet

The following table provides information about the project.

Coordinator
UNIVERSITY OF EAST ANGLIA 

Organization address
address: EARLHAM ROAD
city: NORWICH
postcode: NR4 7TJ
website: http://www.uea.ac.uk

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 United Kingdom [UK]
 Total cost 224˙933 €
 EC max contribution 224˙933 € (100%)
 Programme 1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
 Code Call H2020-MSCA-IF-2018
 Funding Scheme MSCA-IF-EF-ST
 Starting year 2020
 Duration (year-month-day) from 2020-03-01   to  2022-02-28

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERSITY OF EAST ANGLIA UK (NORWICH) coordinator 224˙933.00

Map

 Project objective

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.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "CHROMPART" 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 (fabio@fabiodisconzi.com) 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 "CHROMPART" are provided by the European Opendata Portal: CORDIS opendata.

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

MIGPSC (2018)

Shaping the European Migration Policy: the role of the security industry

Read More  

NaWaTL (2020)

Narrative, Writing, and the Teotihuacan Language: Exploring Language History Through Phylogenetics, Epigraphy and Iconography

Read More  

Long-term migration (2019)

Immigration, Attitudes of Natives and Immigrants Assimilation

Read More