Speaker
Dr
Bhalchandra Thatte
(Oxford University)
Description
Abstract: Ulam (1942) conjectured that each unlabelled simple
finite graph on 3 or more vertices can be constructed from the
collection of its unlabelled induced proper subgraphs. I will
introduce Ulam's conjecture and some related problems, and
survey a few results. I will then discuss a result by Bollobás on
reconstructing almost all graphs.
My current interest is in a variant of Ulam's problem for
population pedigrees (ancestral histories of populations). I will
discuss my attempts to prove results analogous to Bollobás's
result.
