{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:24:06Z","timestamp":1759073046404},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T00:00:00Z","timestamp":1574812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T00:00:00Z","timestamp":1574812800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00454-019-00158-y","type":"journal-article","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T16:03:16Z","timestamp":1574870596000},"page":"584-585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Short Exposition of Salman Parsa\u2019s Theorems on Intrinsic Linking and Non-realizability"],"prefix":"10.1007","volume":"65","author":[{"given":"Arkadiy","family":"Skopenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,27]]},"reference":[{"issue":"3","key":"158_CR1","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s00454-017-9936-1","volume":"59","author":"S Parsa","year":"2018","unstructured":"Parsa, S.: On links of vertices in simplicial $$d$$-complexes embeddable in the euclidean $$2d$$-space. Discrete Comput. Geom. 59(3), 663\u2013679 (2018). (arXiv:1512.05164v4 up to numbering of sections, theorems, etc.; we refer to numbering in the arxiv version)","journal-title":"Discrete Comput. Geom."},{"key":"158_CR2","unstructured":"Parsa, S.: On links of vertices in simplicial $$d$$-complexes embeddable in the euclidean $$2d$$-space (2015). arXiv:1512.05164v6"},{"key":"158_CR3","unstructured":"Skopenkov, A.: Realizability of hypergraphs and Ramsey link theory (2014). arXiv:1402.0658"},{"key":"158_CR4","doi-asserted-by":"crossref","unstructured":"Skopenkov, A.: A short exposition of S. Parsa\u2019s theorems on intrinsic linking and non-realizability (2018). arXiv:1808.08363v2","DOI":"10.1007\/s00454-019-00158-y"},{"issue":"3","key":"158_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.4064\/fm179-3-1","volume":"179","author":"M Skopenkov","year":"2003","unstructured":"Skopenkov, M.: Embedding products of graphs into Euclidean spaces. Fundam. Math. 179(3), 191\u2013198 (2003). arXiv:0808.1199","journal-title":"Fundam. Math."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00158-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00158-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00158-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T19:58:20Z","timestamp":1612900700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00158-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,27]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["158"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00158-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,27]]},"assertion":[{"value":"4 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}