PROEXGRA

Problems in Extremal Graph Theory

Coordinatore	THE UNIVERSITY OF BIRMINGHAM    more  Organization address address: Edgbaston city: BIRMINGHAM postcode: B15 2TT contact info Titolo: Ms. Nome: May Cognome: Chung Email: send email Telefono: 441214000000 Fax: 441214000000
Nazionalità Coordinatore	United Kingdom [UK]
Totale costo	165˙540 €
EC contributo	165˙540 €
Programma	FP7-PEOPLE Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
Code Call	FP7-PEOPLE-2009-IEF
Funding Scheme	MC-IEF
Anno di inizio	2010
Periodo (anno-mese-giorno)	2010-10-01   -   2014-10-02

 Partecipanti

#	participant	country	role	EC contrib. [€]
1	THE UNIVERSITY OF BIRMINGHAM  Organization address address: Edgbaston city: BIRMINGHAM postcode: B15 2TT contact info Titolo: Ms. Nome: May Cognome: Chung Email: send email Telefono: 441214000000 Fax: 441214000000	UK (BIRMINGHAM)	coordinator	165˙540.80

Mappa

 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

 Obiettivo del progetto (Objective)

'Graph theory is a modern branch of mathematics that has developed during the 20th century. Graphs allow us to model real life situations such as social networks, telecommunication networks or road networks. In order to fully understand which are the most relevent properties for graphs, one has to investigate how different properties of graphs interact. This is the core of extremal graph theory. One very natural question in the field is what parameters enforce the existence of a given particular subgraph. More generally, embedding problems seek sufficient condition a graph (or digraph) needs to have in order to contain a given subgraph. Roughly speaking Ramsey theory states that `complete disorder is impossible'. In many cases, this means that if a structure which is arbitrarily partitioned in several pieces, a specific substructure is completely contained in one of these pieces. Within the project, we aim to solve several important problems in the above areas using probabilistic techniques such as the Regularity lemma.'