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

APGRAPH

Financiado

Cerrado

Asymptotic Graph Properties

Many parts of Graph Theory have witnessed a huge growth over the last years, partly because of their relation to Theoretical Computer Science and Statistical Physics. These connections arise because graphs can be used to model man... ver más

30/11/2018

UoB

818K€

Presupuesto del proyecto: 818K€

Líder del proyecto

THE UNIVERSITY OF BIRMINGHAM 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 FP7 notifico la concesión del proyecto el día 2018-11-30 No tenemos la información de la convocatoria

0% 100%

Información adicional privada

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

1 Participantes

UoB

0.00€ | 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

BORCA Borel combinatorics and Approximations 179K€ Cerrado

PROGEOCOM Avenues in Probabilistic and Geometric Combinatorics 1M€ Cerrado

MTM2008-03020 ENUMERACION DE ESTRUCTURAS DISCRETAS: METODOS ANALITICOS, PR... 53K€ Cerrado

LASTING LArge STructures IN random Graphs 225K€ Cerrado

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

HI-DIM COMBINATORICS High dimensional combinatorics 2M€ Cerrado

Líder del proyecto

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

TRL 4-5

Presupuesto del proyecto 818K€

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

Descripción del proyecto Many parts of Graph Theory have witnessed a huge growth over the last years, partly because of their relation to Theoretical Computer Science and Statistical Physics. These connections arise because graphs can be used to model many diverse structures. The focus of this proposal is on asymptotic results, i.e. the graphs under consideration are large. This often unveils patterns and connections which remain obscure when considering only small graphs. It also allows for the use of powerful techniques such as probabilistic arguments, which have led to spectacular new developments. In particular, my aim is to make decisive progress on central problems in the following 4 areas: (1) Factorizations: Factorizations of graphs can be viewed as partitions of the edges of a graph into simple regular structures. They have a rich history and arise in many different settings, such as edge-colouring problems, decomposition problems and in information theory. They also have applications to finding good tours for the famous Travelling salesman problem. (2) Hamilton cycles: A Hamilton cycle is a cycle which contains all the vertices of the graph. One of the most fundamental problems in Graph Theory/Theoretical Computer Science is to find conditions which guarantee the existence of a Hamilton cycle in a graph. (3) Embeddings of graphs: This is a natural (but difficult) continuation of the previous question where the aim is to embed more general structures than Hamilton cycles - there has been exciting progress here in recent years which has opened up new avenues. (4) Resilience of graphs: In many cases, it is important to know whether a graph `strongly’ possesses some property, i.e. one cannot destroy the property by changing a few edges. The systematic study of this notion is a new and rapidly growing area. I have developed new methods for deep and long-standing problems in these areas which will certainly lead to further applications elsewhere.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores