Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Dufresne, Emilie, Jeronimo, Gabriela, Kenkel, Jenny, Lindo, Haydee, Villamizar, Nelly
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915943300464640
author Dufresne, Emilie
Jeronimo, Gabriela
Kenkel, Jenny
Lindo, Haydee
Villamizar, Nelly
author_facet Dufresne, Emilie
Jeronimo, Gabriela
Kenkel, Jenny
Lindo, Haydee
Villamizar, Nelly
contents The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an invariant-theoretic approach to studying it. The aim is to be able to show that polynomials that distinguish between decks also distinguish between original graphs, thus translating a graph-theoretic problem into an algebraic one.
format Preprint
id arxiv_https___arxiv_org_abs_2604_16567
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture
Dufresne, Emilie
Jeronimo, Gabriela
Kenkel, Jenny
Lindo, Haydee
Villamizar, Nelly
Combinatorics
Commutative Algebra
05C60, 13A50
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an invariant-theoretic approach to studying it. The aim is to be able to show that polynomials that distinguish between decks also distinguish between original graphs, thus translating a graph-theoretic problem into an algebraic one.
title Shuffling the Deck: Invariant Theory and the Graph Reconstruction Conjecture
topic Combinatorics
Commutative Algebra
05C60, 13A50
url https://arxiv.org/abs/2604.16567