{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T14:45:49Z","timestamp":1770561949488,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0095-8956(89)90016-6","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"153-161","source":"Crossref","is-referenced-by-count":19,"title":["Combinatorial reconstruction problems"],"prefix":"10.1016","volume":"47","author":[{"given":"N","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y","family":"Caro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I","family":"Krasikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y","family":"Roditty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(89)90016-6_BIB1","unstructured":"N. Alon and A. Liu, An application of set theory to error correcting codes, Math. Mag., in press."},{"key":"10.1016\/0095-8956(89)90016-6_BIB2","series-title":"The reconstruction of graphs","author":"Bondy","year":"1984"},{"key":"10.1016\/0095-8956(89)90016-6_BIB3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","article-title":"On sets of distances of n points","volume":"53","author":"Erd\u00f6s","year":"1946","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0095-8956(89)90016-6_BIB4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0195-6698(83)80004-3","article-title":"On the number of sets in a null t-design","volume":"4","author":"Frankl","year":"1983","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(89)90016-6_BIB5","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0095-8956(87)90013-X","article-title":"Reconstructing graphs from their k-edge deleted subgraphs","volume":"43","author":"Godsil","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90016-6_BIB6","series-title":"Theory of Graphs and its Applications","first-page":"47","article-title":"On the reconstruction of a graph from a collection of subgraphs","author":"Harary","year":"1964"},{"key":"10.1016\/0095-8956(89)90016-6_BIB7","series-title":"An introduction to the Theory of Numbers","author":"Hardy","year":"1945"},{"key":"10.1016\/0095-8956(89)90016-6_BIB8","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF01189639","article-title":"Balance equations for reconstruction problems","volume":"48","author":"Krasikov","year":"1987","journal-title":"Arch. Math."},{"key":"10.1016\/0095-8956(89)90016-6_BIB9","unstructured":"I. Krasikov and Y. Roditty, A counting technique for reconstruction problems, Ars Combin. in press."},{"key":"10.1016\/0095-8956(89)90016-6_BIB10","unstructured":"I. Krasikov and Y. Roditty, Geometrical reconstruction. Ars Combin., in press."},{"key":"10.1016\/0095-8956(89)90016-6_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0095-8956(72)90068-8","article-title":"A note on the line reconstruction problem","volume":"13","author":"Lov\u00e1sz","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90016-6_BIB12","doi-asserted-by":"crossref","unstructured":"H. Lefmann, An extremal problem for Graham-Rothschild parameter words, Combinatorica, in press.","DOI":"10.1007\/BF02124677"},{"key":"10.1016\/0095-8956(89)90016-6_BIB13","author":"McWilliams","year":"1977"},{"key":"10.1016\/0095-8956(89)90016-6_BIB14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0095-8956(77)90074-0","article-title":"The edge reconstruction conjecture is true for graphs with more than n log2n edges","volume":"22","author":"Muller","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(89)90016-6_BIB15","series-title":"Selected Topics in Graph Theory","first-page":"205","article-title":"The reconstruction problem","author":"Nash-Williams","year":"1978"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900166?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:52:52Z","timestamp":1548759172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895689900166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0095895689900166"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90016-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}