Recherche

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

Exposé en anglais / Talk in english A simple greedy procedure shows that the chromatic number $\chi(G)$ of a graph $G$ is upper bounded by $\Delta(G)

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

The celebrated Linear Arboricity Conjecture of Akiyama, Exoo, and Harary from 1980 asserts that the edges of every graph with maximum degree Δ can be

Using the Graph Minor Theorem, by Robertson and Seymour, one can easily prove that there are only a finite number of excluded minors for a given

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

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

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:/

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

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