{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T21:15:58Z","timestamp":1713388558133},"reference-count":16,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T00:00:00Z","timestamp":1596585600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2021,2]]},"abstract":"Abstract<\/jats:title>The deck of a graph is given by the multiset of (unlabeled) subgraphs . The subgraphs are referred to as the cards of . Brown and Fenner recently showed that, for , the number of edges of a graph can be computed from any deck missing 2 cards. We show that, for sufficiently large , the number of edges can be computed from any deck missing at most cards.<\/jats:p>","DOI":"10.1002\/jgt.22616","type":"journal-article","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T06:07:21Z","timestamp":1596694041000},"page":"326-337","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Size reconstructibility of graphs"],"prefix":"10.1002","volume":"96","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9878-8750","authenticated-orcid":false,"given":"Carla","family":"Groenland","sequence":"first","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford United Kingdom"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0525-0039","authenticated-orcid":false,"given":"Hannah","family":"Guggiari","sequence":"additional","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford United Kingdom"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4489-5988","authenticated-orcid":false,"given":"Alex","family":"Scott","sequence":"additional","affiliation":[{"name":"Mathematical Institute University of Oxford Oxford United Kingdom"}]}],"member":"311","published-online":{"date-parts":[[2020,8,5]]},"reference":[{"key":"e_1_2_5_2_1","first-page":"443","article-title":"A survey of some open questions in reconstruction numbers","volume":"97","author":"Asciak K.","year":"2010","journal-title":"Ars Combin."},{"key":"e_1_2_5_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140102"},{"key":"e_1_2_5_4_1","first-page":"221","article-title":"A graph reconstructor\u02bcs manual","volume":"166","author":"Bondy J.","year":"1991","journal-title":"Surv. Combin."},{"key":"e_1_2_5_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010306"},{"key":"e_1_2_5_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20415"},{"key":"e_1_2_5_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20531"},{"key":"e_1_2_5_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.08.026"},{"key":"e_1_2_5_9_1","unstructured":"P.Kelly On isometric transformations Ph.D. Thesis University of Wisconsin 1942."},{"key":"e_1_2_5_10_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.961"},{"key":"e_1_2_5_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316669846"},{"key":"e_1_2_5_12_1","first-page":"709","article-title":"Probabilistic reconstruction from subgraphs","volume":"17","author":"M\u00fcller V.","year":"1976","journal-title":"Comment. Math. Univ. Carolin."},{"key":"e_1_2_5_13_1","unstructured":"W.Myrvold Ally and adversary reconstruction problems Ph.D. Thesis University of Waterloo 1988."},{"key":"e_1_2_5_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90053-I"},{"key":"e_1_2_5_15_1","first-page":"205","volume-title":"Selected Topics in Graph Theory","author":"Nash\u2010Williams C.","year":"1978"},{"key":"e_1_2_5_16_1","volume-title":"Interscience tracts in pure and applied mathematics","author":"Ulam S.","year":"1960"},{"key":"e_1_2_5_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.06.015"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22616","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22616","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.22616","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T07:54:39Z","timestamp":1693814079000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10.1002\/jgt.22616"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22616","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,5]]},"assertion":[{"value":"2018-07-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-07-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}