Recherche

A landmark result of Alon and Shapira characterises testable graph properties by showing that every such property can be described via the Szemerédi

Consider a graph G with a path P of order n. What conditions force G to also have a long induced path? In this talk, we will propose a new way to

We will look at an analogue theorem of the classical Erdős-Pósa Theorem. We prove a $GF(q)$-representable matroid analogue of Robertson and Seymour's

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

A temporal graph G is a sequence of graphs G1, G2, ... , Gt on the same vertex set. In this talk, we are interested in the analogue of the Travelling

N/A Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres

Soutenance de thèse / PhD. Defense [Timothée Corsini] (LaBRI) Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https:/

In 1943, Hadwiger conjectured that every k-chromatic graph has a K_k-minor. While the cases k = 5 and k = 6 have been shown to be equivalent to the

Session problèmes ouverts. Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php

Phylogenetic networks are directed graphs used to represent evolutionary histories in the presence of events in which several entities may combine to