{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T22:27:48Z","timestamp":1775687268421,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:00:00Z","timestamp":1773878400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.ejc.2026.104372","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T08:48:57Z","timestamp":1773996537000},"page":"104372","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generalized Erd\u0151s\u2013Rogers problems for hypergraphs"],"prefix":"10.1016","volume":"135","author":[{"given":"Xiaoyu","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxi","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejc.2026.104372_b1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","article-title":"A note on Ramsey numbers","volume":"29","author":"Ajtai","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104372_b2","series-title":"The Probabilistic Method","author":"Alon","year":"2016"},{"issue":"1","key":"10.1016\/j.ejc.2026.104372_b3","doi-asserted-by":"crossref","DOI":"10.1002\/rsa.21273","article-title":"On the maximum F-free induced subgraphs in Kt-free graphs","volume":"66","author":"Balogh","year":"2025","journal-title":"Random Structures Algorithms"},{"issue":"11","key":"10.1016\/j.ejc.2026.104372_b4","doi-asserted-by":"crossref","DOI":"10.1093\/imrn\/rnaf122","article-title":"On off-diagonal hypergraph Ramsey numbers","author":"Conlon","year":"2025","journal-title":"Int. Math. Res. Not. IMRN"},{"issue":"11","key":"10.1016\/j.ejc.2026.104372_b5","first-page":"4605","article-title":"When are off-diagonal hypergraph Ramsey numbers polynomial?","volume":"153","author":"Conlon","year":"2025","journal-title":"Proc. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2026.104372_b6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1090\/S0894-0347-09-00645-6","article-title":"Hypergraph Ramsey numbers","volume":"23","author":"Conlon","year":"2010","journal-title":"J. Amer. Math. Soc."},{"issue":"2015","key":"10.1016\/j.ejc.2026.104372_b7","first-page":"49","article-title":"Recent developments in graph Ramsey theory","volume":"424","author":"Conlon","year":"2015","journal-title":"Surv. Comb."},{"issue":"3","key":"10.1016\/j.ejc.2026.104372_b8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.21760","article-title":"On generalized Ramsey numbers for 3-uniform hypergraphs","volume":"76","author":"Dudek","year":"2014","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104372_b9","series-title":"Combinatorics (Proc. Conf. Combinatorial Math., Math. Inst., Oxford, 1972)","first-page":"123","article-title":"On Ramsey like theorems. Problems and results","author":"Erd\u0151s","year":"1972"},{"key":"10.1016\/j.ejc.2026.104372_b10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.4153\/CJM-1962-060-4","article-title":"The construction of certain graphs","volume":"14","author":"Erd\u0151s","year":"1962","journal-title":"Canad. J. Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104372_b11","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1112\/plms.12400","article-title":"Independent sets in hypergraphs with a forbidden link","volume":"123","author":"Fox","year":"2021","journal-title":"Proc. Lond. Math. Soc. (3)"},{"issue":"2","key":"10.1016\/j.ejc.2026.104372_b12","doi-asserted-by":"crossref","DOI":"10.1007\/s00493-025-00147-1","article-title":"Induced subgraphs of Kr-free graphs and the Erd\u0151s-Rogers problem","volume":"45","author":"Gishboliner","year":"2025","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejc.2026.104372_b13","series-title":"Random Graphs","author":"Janson","year":"2011"},{"issue":"1","key":"10.1016\/j.ejc.2026.104372_b14","doi-asserted-by":"crossref","DOI":"10.1002\/rsa.21280","article-title":"Improved bounds for the Erd\u0151s\u2013Rogers (s, s+ 2)-problem","volume":"66","author":"Janzer","year":"2025","journal-title":"Random Structures Algorithms"},{"issue":"3","key":"10.1016\/j.ejc.2026.104372_b15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/rsa.3240070302","article-title":"The Ramsey number R(3,t) has order of magnitude t2\/logt","volume":"7","author":"Kim","year":"1995","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"10.1016\/j.ejc.2026.104372_b16","doi-asserted-by":"crossref","first-page":"919","DOI":"10.4007\/annals.2024.199.2.8","article-title":"The asymptotics of r(4,t)","volume":"199","author":"Mattheus","year":"2024","journal-title":"Ann. Math."},{"key":"10.1016\/j.ejc.2026.104372_b17","series-title":"Erd\u0151s\u2013Rogers functions for arbitrary pairs of graphs","author":"Mubayi","year":"2024"},{"issue":"2","key":"10.1016\/j.ejc.2026.104372_b18","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1112\/blms.13214","article-title":"On the order of the classical Erd\u0151s\u2013Rogers functions","volume":"57","author":"Mubayi","year":"2025","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.ejc.2026.104372_b19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/rsa.20035","article-title":"Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems","volume":"26","author":"Sudakov","year":"2005","journal-title":"Random Structures Algorithms"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T21:39:01Z","timestamp":1775684341000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":19,"alternative-id":["S0195669826000405"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104372","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized Erd\u0151s\u2013Rogers problems for hypergraphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104372","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104372"}}