Aspects of connectivity with matroid constraints in graphs

Abstract: The notion of connectivity is fundamental in graph theory. We study a recent development in this field, with the addition of matroid constraints. We extend Menger’s and Edmonds’ packing theorems in this new theory. By finding a counterexample with more than 300 vertices, we disprove a recent conjecture from András Frank.

Manuscrit Soutenance

Articles de recherche