The combinatorial \(k\)-deck

DOI10.1007/s00373-018-1939-zzbMath1402.05079OpenAlexW2889087150WikidataQ129269037 ScholiaQ129269037MaRDI QIDQ1756123

Jan Simon

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1939-z

zbMATH Keywords

reconstructiondeckKelly lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Shotgun reconstruction in the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Reconstructing under group actions.
• Phase retrieval
• Combinatorial reconstruction problems
• Reconstructing subsets of \(\mathbb{Z}_n\)
• Reconstruction of functions from their triple correlations
• The bispectrum as a source of phase-sensitive invariants for Fourier descriptors: a group-theoretic approach
• The use of higher-order invariants in the determination of generalized Patterson cyclotomic sets
• Graph reconstruction—a survey
• The Reconstructibility of Finite Abelian Groups

This page was built for publication: The combinatorial \(k\)-deck