BIMSA >
ICMRA Seminar Series
ICMRA Seminar Series
On reconstruction numbers and (multi)deck cardinalitites in phylogenetic tree shapes
On reconstruction numbers and (multi)deck cardinalitites in phylogenetic tree shapes
Organizers
Speaker
Audace A. V. Dossou-Olory
Time
Thursday, April 30, 2026 3:00 PM - 4:30 PM
Venue
A6-101
Online
Zoom 815 762 8413
(BIMSA)
Abstract
The $m$-multideck of a graph is the multiset of the isomorphism classes of all its unlabeled induced subgraphs on $m$ vertices. A graph $G$ is reconstructible from its $m$-multideck if any graph with the same $m$-multideck is isomorphic to $G$. Reconstructibility of an $n$-vertex graph $G$ from its $(n-l)$-multideck is known as $l$-reconstructibility of $G$. In this talk, we will first discuss some knowledge on this graph reconstructibility. Since general trees are known to be $1$-reconstructible, we will conclude the talk with a new development concerning decks (sets) and multidecks of phylogenetic tree shapes (rooted binary trees) comprising only subtrees induced by leaves.
Speaker Intro
Audace Dossou-Olory is currently a senior lecturer of Mathematics and Hydroinformatics at the University of Abomey-Calavi in Benin. His main research interests lie in Discrete Mathematics (Combinatorics, Graph Theory). Dossou-Olory served as a Research Fellow at the University of Johannesburg (South Africa), following both a PhD in Discrete Mathematics and an MSc in Mathematical Sciences obtained at Stellenbosch University and AIMS (South Africa). Dossou-Olory completed his undergraduate studies in Benin, with both a Design Electrical Engineering Diploma at the École Polytechnique d'Abomey-Calavi and a Maitrise in Mathematics (Benin). He is one of the two winners of the Ibni Prize 2020.
He is visiting BIMSA with a support from the "ICMRA Visiting Scholars Program".
He is visiting BIMSA with a support from the "ICMRA Visiting Scholars Program".