Good news and bad news for tree reconstruction
When is a graph uniquely determined by its vertex-deleted subgraphs?
When is a graph uniquely determined by its vertex-deleted subgraphs? This is the central question in graph reconstruction, which features in Bondy’s list of beautiful conjectures in graph theory as well as Harary’s list of “graphical diseases” (while highly contagious, it is not typically dangerous!). I will give an introduction to some key results, tools, and variants of the classical reconstruction problem, and discuss recent progress toward and outlook for Nýdl’s conjecture on reconstructing trees from small cards.
In-person attendance is available for up to 72 people.
All attendees will be asked to check in using the CBR Covid-safe Check-In app or sign in on arrival.
To obtain a Zoom link, please click here
If you would like to attend but are unable to access the Zoom Link, please contact the Martin Helmer at email@example.com.
Seminar Room 1.33, Building 145, Science Road, ANU
Virtual attendance available - via Zoom