Evènement pour le groupe GT Graphes et Applications

Date 2014-12-19  14:00-15:00
TitreEdge-decompositions of graphs with maximum bounded degree 
RésuméIn this talk I will introduce two problems on edge-decompositions of graphs with bounded maximum degree. First, I will present a new approach to acyclic edge colorings of graphs with large girth. Using it, we obtain asymptotically tight results on a conjecture of Alon, Sudakov and Zaks. In the second part I will talk about the problem of partitioning the edges of a graph in different improper color classes with no monochromatic copy of a fixed graph. I will present an iterative embedding argument that allows us to transfer classical results from Extremal Graph Theory to bounded degree graphs. The common denominator of these two topics is the use of the so-called semirandom method. All the presented results are joint work with Cai, Reed and Watts (Part 1) and with Foucaud, Kang, Krivelevich and Reed (Part 2). 
LieuSalle 178 
OrateurGuillem Perarnau 

Aucun document lié à cet événement.

Retour à l'index