Combinatorial reconstruction problems

DOI10.1016/0095-8956(89)90016-6zbMath0633.05050WikidataQ56213622 ScholiaQ56213622MaRDI QIDQ1095932

Yair Caro, Noga Alon, Ilia Krasikov, Yehuda Roditty

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

zbMATH Keywords

graphs; hypergraphs; reconstruction problems; null t-designs

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05C65: Hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

A survey on edge reconstruction of graphs, Reconstructing finite sets of points in \(R^n\) up to groups of isometries, Reconstructing infinite sets of integers, Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture, The \(k\)-orbit reconstruction and the orbit algebra, Reconstructing subsets of \(\mathbb{Z}_n\), Kernels of modular inclusion maps, Finite-type invariants for graphs and graph reconstructions

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item