{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:18:20Z","timestamp":1740111500254,"version":"3.37.3"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-1102086","DMS-1301698"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1016\/j.disc.2015.09.019","type":"journal-article","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T18:07:20Z","timestamp":1448734040000},"page":"1147-1149","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A short proof of the induced Ramsey Theorem for hypergraphs"],"prefix":"10.1016","volume":"339","author":[{"given":"Vindya","family":"Bhat","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2015.09.019_br000005","doi-asserted-by":"crossref","first-page":"572","DOI":"10.2307\/2273534","article-title":"Models without indiscernibles","volume":"43","author":"Abramson","year":"1978","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.disc.2015.09.019_br000010","series-title":"Infinite and Finite Sets, vol. 1","first-page":"323","article-title":"A generalization of Ramsey\u2019s theorem","volume":"vol. 10","author":"Deuber","year":"1975"},{"issue":"1","key":"10.1016\/j.disc.2015.09.019_br000015","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02565753","article-title":"Partitionstheoreme f\u00fcr Graphen","volume":"50","author":"Deuber","year":"1975","journal-title":"Comment. Math. Helv."},{"key":"10.1016\/j.disc.2015.09.019_br000020","series-title":"Infinite and Finite Sets, vol. 1","first-page":"585","article-title":"Strong embeddings of graphs into colored graphs","volume":"vol. 10","author":"Erd\u0151s","year":"1975"},{"key":"10.1016\/j.disc.2015.09.019_br000025","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1090\/S0002-9947-1963-0143712-1","article-title":"Regularity and positional games","volume":"106","author":"Hales","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.disc.2015.09.019_br000030","series-title":"Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974)","first-page":"405","article-title":"Type theory of partition properties of graphs","author":"Ne\u0161et\u0159il","year":"1975"},{"issue":"3","key":"10.1016\/j.disc.2015.09.019_br000035","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0097-3165(77)90004-8","article-title":"Partitions of finite relational and set systems","volume":"22","author":"Ne\u0161et\u0159il","year":"1977","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"10.1016\/j.disc.2015.09.019_br000040","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9939-1978-0507350-7","article-title":"On a probabilistic graph-theoretic method","volume":"72","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.disc.2015.09.019_br000045","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1090\/S0002-9947-1987-0896015-8","article-title":"Strong Ramsey theorems for Steiner systems","volume":"303","author":"Ne\u0161et\u0159il","year":"1987","journal-title":"Trans. Amer. Math. Soc."},{"year":"1973","series-title":"The dimension of a graph and generalized Ramsey theorems","author":"R\u00f6dl","key":"10.1016\/j.disc.2015.09.019_br000050"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15003404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X15003404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T01:05:19Z","timestamp":1583456719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X15003404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["S0012365X15003404"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2015.09.019","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2016,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A short proof of the induced Ramsey Theorem for hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2015.09.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}