Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, December 07, 2021, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Charlotte Knierim

Reconstructibility of the K_r-count from n-1 cards

The reconstruction conjecture by Kelly and Ulam was posed in the 40s and is still widely open today. A lemma by Kelly states that one can count subgraphs on at most n-1 vertices given all the cards. We show that the clique count in G is reconstructable for all but one size of the clique from n-1 cards. This is joint work with Anders Martinsson.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login