Carla Groenland

University of Oxford

Reconstruction from a partial deck of cards

Combinatorics Seminar

18th February 2020, 11:00 am – 12:00 pm
Fry Building, 2.04

The graph reconstruction conjecture states that each (finite, undirected, simple) graph G on at least 3 vertices can be reconstructed from the multiset {G-v:v in V(G)}, where G-v denotes the graph G with v and all incident edges removed. Although this conjecture is notoriously difficult, it is easy to reconstruct some information about the graph from this "deck of cards'', e.g. the number of edges and degree sequence of G. In this talk, I will talk about some of our recent progress on reconstructing such information from a partial deck of cards.

Comments are closed.