2000 character limit reached
3-Regular Graphs Are 2-Reconstructible
Published 4 Aug 2019 in math.CO | (1908.01258v1)
Abstract: A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.