Ulam reconstruction conjecture for infinite graphs of finite vertex degrees
Let be an infinite graph with vertex set , and let denote the degree of . Ulam reconstruction conjecture. If
then is Ulam-reconstructible. The source gives this as a further sufficient condition for reconstruction of infinite graphs, without supplying evidence of a proof or refutation.
References
Primary source
Mohamed Sghiar, “Mesure et action des i-permutations sur les multigraphes multicolores finis et inifinis”, arXiv:1506.08963 (2015).
Additional references
3 papers in this index state this conjecture (2009–2015). The statement above is taken from the most recent of them; the others are arXiv:1112.1509, arXiv:0912.2619.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.