A combinatorial $K$-theory perspective on the Edge Reconstruction Conjecture in graph theory
Abstract: We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some fundamental theorems for the $K$-theory of categories with covering families.
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.