Switching reconstruction and diophantine equations
type: Item
instance of: scholarly article
title: Switching reconstruction and diophantine equations
zbMATH Open document ID: 0702.05062
DOI: 10.1016/0095-8956(92)90050-8
published in: Journal of Combinatorial Theory. Series B
publication date: 1991-01-01T00:00:00Z
review text: Based on a result of \textit{R. P. Stanley} [``Reconstruction from vertex switching'', J. Comb. Theory, Ser. B 38, 132-138 (1985; Zbl 0572.05046)], we show that for each \(s\geq 4\) there exists an integer \(N_ s\) such that any graph with \(n>N_ s\) vertices is reconstructible from the multiset of graphs obtained by switching of vertex subsets with s vertices, provided \(n\neq O(mod 4)\) if s is odd. We also establish an analog of \textit{P. J. Kelly}'s lemma [``A congruence theorem for trees'', Pac. J. Math. 7, 961-968 (1957; Zbl 0078.371)] for the above s-switching reconstruction problem.
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 4150216
author: Ilia Krasikov
author: Yehuda Roditty
MaRDI profile type: Publication
full work available at URL: 0095-8956(92)90050-8
OpenAlex ID: W2078424188
cites work: Q5562698
cites work: A congruence theorem for trees
cites work: Balance equations for reconstruction problems
cites work: A note on the vertex-switching reconstruction
cites work: Q3946078
cites work: Q3870936
cites work: Q4050661
cites work: Q3744223
cites work: Reconstruction from vertex-switching
cites work: Q5625350
description: scientific article; zbMATH DE number 4150216