Moteur de recherche d’entreprises européennes

UK funding (219 535 £) : Combinatoire extrémale et énumération asymptotique Ukri01/09/2011 UK Research and Innovation, Royaume Uni

Vue d’ensemble

Texte

Combinatoire extrémale et énumération asymptotique

Abstract Combinatorics is a branch of mathematics studying finite structures. The generality of these questions suggests wide applicability of combinatorics in other areas of pure mathematics (most notably in algebra, number theory, probability, and topology), as well as in real-world applications (discrete optimization, computer science).One of the oldest and most central parts of combinatorics are graph theory and enumerative combinatorics. Graph theory models networks (such as road connections, or internet users), and enumerative combinatorics concerns studying counting questions of various kinds.Extremal graph theory is a broad part of graph theory which investigates interplay between various graph parameters. One of the main tools in Extremal graph theory is the so-called Szemeredi Regularity Lemma. This tool (developed in the 70's) has become one of the corner-stones of modern mathematics. Recently, using the insights gained from the Regularity Lemma, Lovasz and Szegedy initiated study of graph limits.The proposed research project addresses major open questions in extremal graph theory and aims contribute to general theories the Regularity Lemma, graph limits, and by developing novel tools which will be used in enumerative combinatorics.
Category Fellowship
Reference EP/I026630/1
Status Closed
Funded period start 01/09/2011
Funded period end 31/08/2014
Funded value £219 535,00
Source https://gtr.ukri.org/projects?ref=EP%2FI026630%2F1

Participating Organisations

University of Warwick
Eotvos Lorand University
University of California Los Angeles
Hungarian Academy of Sciences

Cette annonce se réfère à une date antérieure et ne reflète pas nécessairement l’état actuel. L’état actuel est présenté à la page suivante : University of Warwick, Coventry, Royaume Uni.

Creative Commons License Les visualisations de "University of Warwick - UK funding (219 535 £) : Combinatoire extrémale et énumération asymptotique" sont mis à disposition par North Data et peuvent être réutilisées selon les termes de la licence Creative Commons CC-BY.