Recherche

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

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

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

A triangulation of a surface is k-irreducible if every edge belongs to a non-contractible curve of length k and there are no shorter non-contractible

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

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

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