{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T18:03:50Z","timestamp":1780423430718,"version":"3.54.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:00:00Z","timestamp":1775606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","award":["200021-228014"],"award-info":[{"award-number":["200021-228014"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jctb.2026.04.002","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:41:18Z","timestamp":1775817678000},"page":"250-269","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Lower bounds for Ramsey numbers of bounded degree hypergraphs"],"prefix":"10.1016","volume":"179","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8058-7782","authenticated-orcid":false,"given":"Domagoj","family":"Brada\u010d","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zach","family":"Hunter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2026.04.002_br0010","article-title":"The Probabilistic Method","author":"Alon","year":"2016"},{"key":"10.1016\/j.jctb.2026.04.002_br0020","author":"Balister"},{"issue":"1","key":"10.1016\/j.jctb.2026.04.002_br0030","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1017\/S0305004124000409","article-title":"Ramsey numbers of hypergraphs of a given size","volume":"178","author":"Brada\u010d","year":"2025","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0040","doi-asserted-by":"crossref","DOI":"10.1007\/s40687-024-00463-w","article-title":"The growth rate of multicolor Ramsey numbers of 3-graphs","volume":"11","author":"Brada\u010d","year":"2024","journal-title":"Res. Math. Sci."},{"key":"10.1016\/j.jctb.2026.04.002_br0050","doi-asserted-by":"crossref","DOI":"10.4007\/annals.2026.203.3.4","article-title":"An exponential improvement for diagonal Ramsey","author":"Campos","year":"2026","journal-title":"Ann. Math."},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0060","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","article-title":"The Ramsey number of a graph with bounded maximum degree","volume":"34","author":"Chvat\u00e1l","year":"1983","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.jctb.2026.04.002_br0070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20260","article-title":"Ramsey numbers of sparse hypergraphs","volume":"35","author":"Conlon","year":"2009","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"10.1016\/j.jctb.2026.04.002_br0080","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00493-012-2710-3","article-title":"On two problems in graph Ramsey theory","volume":"32","author":"Conlon","year":"2012","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0090","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.jctb.2007.08.008","article-title":"3-uniform hypergraphs of bounded degree have linear Ramsey numbers","volume":"98","author":"Cooley","year":"2008","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0100","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00493-009-2356-y","article-title":"Embeddings and Ramsey numbers of sparse k-uniform hypergraphs","volume":"29","author":"Cooley","year":"2009","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0110","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/S0097539793247634","article-title":"A fast approximation algorithm for computing the frequencies of subgraphs in a given graph","volume":"24","author":"Duke","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"10.1016\/j.jctb.2026.04.002_br0120","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0012-365X(97)00184-2","article-title":"Ramsey numbers for sparse graphs","volume":"185","author":"Eaton","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2026.04.002_br0130","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","article-title":"Some remarks on the theory of graphs","volume":"53","author":"Erd\u0151s","year":"1947","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"10.1016\/j.jctb.2026.04.002_br0140","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1112\/plms\/s3-2.1.417","article-title":"Combinatorial theorems on classifications of subsets of a given set","volume":"3","author":"Erd\u0151s","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/j.jctb.2026.04.002_br0150","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compos. Math."},{"issue":"2","key":"10.1016\/j.jctb.2026.04.002_br0160","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","article-title":"Density theorems for bipartite graphs and related Ramsey-type results","volume":"29","author":"Fox","year":"2009","journal-title":"Combinatorica"},{"key":"10.1016\/j.jctb.2026.04.002_br0170","series-title":"Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing","first-page":"720","article-title":"A proof of Alon's second eigenvalue conjecture","author":"Friedman","year":"2003"},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0180","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C","article-title":"On graphs with linear Ramsey numbers","volume":"35","author":"Graham","year":"2000","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2026.04.002_br0190","series-title":"Ramsey Theory, vol. 20","author":"Graham","year":"1991"},{"key":"10.1016\/j.jctb.2026.04.002_br0200","author":"Gupta"},{"key":"10.1016\/j.jctb.2026.04.002_br0210","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","article-title":"Random Graphs","author":"Janson","year":"2000"},{"issue":"3","key":"10.1016\/j.jctb.2026.04.002_br0220","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00373-008-0784-x","article-title":"On the Ramsey number of sparse 3-graphs","volume":"24","author":"Nagle","year":"2008","journal-title":"Graphs Comb."},{"issue":"1","key":"10.1016\/j.jctb.2026.04.002_br0230","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","article-title":"On a problem of formal logic","volume":"s2\u201330","author":"Ramsey","year":"1930","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895626000225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895626000225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:29:35Z","timestamp":1780421375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895626000225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":23,"alternative-id":["S0095895626000225"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2026.04.002","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lower bounds for Ramsey numbers of bounded degree hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2026.04.002","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 Inc.","name":"copyright","label":"Copyright"}]}}