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

QRGRAPH

Financiado

Cerrado

Quasirandomness in Graphs and Hypergraphs

A structure is called quasirandom if it has a number of properties that one would expect from a random structure with similar parameters. For instance, a graph is quasirandom if its edges are spread evenly over the vertices. This... ver más

30/11/2015

UoB

743K€

Presupuesto del proyecto: 743K€

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 2015-11-30 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

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

1 Participantes

UoB

0.00€ | Lider

Proyectos interesantes

QuasiHyp

Data Science

Software

240K€ Cerrado

PECTA

Data Science

Software

100K€ Cerrado

LaDIST

Data Science

Software

1M€ Cerrado

BUKA

Software

Data Science

2M€ Cerrado

DMMCA

Data Science

Software

1M€ Cerrado

AFMIDMOA

Data Science

Software

2M€ Cerrado

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

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 743K€

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

Descripción del proyecto A structure is called quasirandom if it has a number of properties that one would expect from a random structure with similar parameters. For instance, a graph is quasirandom if its edges are spread evenly over the vertices. This concept has been remarkably useful in many areas, including Number theory, Graph theory and the design of algorithms. Quasirandomness is a field that is developing very rapidly, but there are many connections and properties that are still unexplored. In my proposal, I will concentrate on 4 important topics where I believe that quasirandomness is crucial to further progress: hypergraph matchings, decompositions of graphs, topological subgraphs as well as sparse graphs and hypergraphs. As an illustration of a matching problem, consider a group of people and construct a graph by drawing an edge if they like each other - a perfect matching splits the people into teams of 2 which can work together. How and when this can be achieved for teams of 2 is well understood, but not for teams of 3 or more people. This can be formulated as a hypergraph matching problem. I believe that quasirandom decompositions can be used to give quite general sufficient conditions which guarantee a perfect hypergraph matching. A better understanding of quasirandomness of sparse hypergraphs would have applications e.g. to checking whether a Boolean formula is satisfiable. This is one of the fundamental problems in Theoretical Computer Science.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores