When: le jeudi 20 mars 2025
Where: à 15h00 en salle 4A113 à Palaiseau
Title: « Open problem in digraphs »
Abstract:
We discuss a large number of open problems on digraphs, some of which have been known in the literature for more than 40 years and some much younger. We will survey partial results for special cases of many of the problems. The topics include: spanning closed trails avoiding prescribed arcs in tournaments, increasing arc or vertex-connectivity by arc-reversals or deorienting arcs, spanning oriented graphs in digraphs, 2-partitions of digraphs, arc-disjoint spanning subdigraphs (branchings, spanning strong subdigraphs), Hamiltonian cycles, linkages (disjoint paths with prescribed end vertices), certificates for k-strong connectivity of a digraph.
Short Bio
Professor Jørgen Bang-Jensen is a professor at the University of Southern Denmark (SDU), specializing in graph theory, algorithms, and combinatorial optimization. His research primarily focuses on digraphs (directed graphs), with significant contributions to understanding their connectivity, structure, and algorithmic applications. He is widely recognized as the co-author of Digraphs: Theory, Algorithms, and Applications, a fundamental reference in the field. He will give a talk entitled « open problem in digraphs » on March 20 in Palaiseau, room 4A113 at 15h.
Contact pour plus d’information: Alessandro MADDALONI et Walid BEN AMEUR