CCOSA
Classes of combinatorial objects: from structure to algorithms
| Coordinatore | THE UNIVERSITY OF WARWICK
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | United Kingdom [UK] |
| Totale costo | 849˙000 € |
| EC contributo | 849˙000 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2010-StG_20091028 |
| Funding Scheme | ERC-SG |
| Anno di inizio | 2010 |
| Periodo (anno-mese-giorno) | 2010-12-01 - 2015-11-30 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
UNIVERZITA KARLOVA V PRAZE
Organization address
address: Ovocny trh 5 contact info |
CZ (PRAHA 1) | beneficiary | 248˙215.99 |
| 2 |
THE UNIVERSITY OF WARWICK
Organization address
address: Kirby Corner Road - University House - contact info |
UK (COVENTRY) | hostInstitution | 600˙784.01 |
| 3 |
THE UNIVERSITY OF WARWICK
Organization address
address: Kirby Corner Road - University House - contact info |
UK (COVENTRY) | hostInstitution | 600˙784.01 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'The proposed project aims at analyzing fundamental problems from combinatorics using the most current methods available and at providing new structural and algorithmic insights to such problems. The problems considered will be treated on a general level of classes of combinatorial objects of the same kind and the developed general methods will also be applied to specific open problems. Classes of dense and sparse objects will be treated using different techniques. Dense combinatorial objects appear in extremal combinatorics and tools developed to handle them found their applications in different areas of mathematics and computer science. The project will focus on extending known methods to new classes of combinatorial objects, in particular those from algebra, and applying the most current techniques including Razborov flag algebras to problems from extremal combinatorics. Applications of the obtained results in property testing will also be considered. On the other hand, algorithmic applications often include manipulating with sparse objects. Examples of sparse objects are graphs embeddable in a fixed surface and more general minor-closed classes of graphs. The project objectives include providing new structural results and algorithmic metatheorems for classes of sparse objects using both classical tools based on the theory of graph minors as well as new tools based on the framework of classes of nowhere-dense structures.'