Combinatorial reconstruction problems
From MaRDI portal
Publication:1095932
DOI10.1016/0095-8956(89)90016-6zbMath0633.05050OpenAlexW2029726795WikidataQ56213622 ScholiaQ56213622MaRDI QIDQ1095932
Ilia Krasikov, Noga Alon, Yehuda Roditty, Yair Caro
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90016-6
Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (14)
Finite-type invariants for graphs and graph reconstructions ⋮ A survey on edge reconstruction of graphs ⋮ Kernels of modular inclusion maps ⋮ Shotgun reconstruction in the hypercube ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture ⋮ Set Reconstruction on the Hypercube ⋮ Graph reconstruction from path correlation data ⋮ The \(k\)-orbit reconstruction and the orbit algebra ⋮ The combinatorial \(k\)-deck ⋮ Reconstructing infinite sets of integers ⋮ Reconstructing finite sets of points in \(R^n\) up to groups of isometries ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Switching Reconstruction of Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem for Graham-Rothschild parameter words
- Balance equations for reconstruction problems
- Reconstructing graphs from their k-edge deleted subgraphs
- The edge reconstruction hypothesis is true for graphs with more than n log n edges
- On the number of sets in a null t-design
- A note on the line reconstruction problem
- On the reconstruction of a graph from its closure function
- On Sets of Distances of n Points
This page was built for publication: Combinatorial reconstruction problems
