{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T11:53:11Z","timestamp":1768218791043,"version":"3.49.0"},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T00:00:00Z","timestamp":1761523200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2026,1]]},"abstract":"Abstract<\/jats:title>\n \n For\n \n \n \n $\\ell \\geq 3$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , an\n \n \n \n $\\ell$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -uniform hypergraph is\n disperse<\/jats:italic>\n if the number of edges induced by any set of\n \n \n \n $\\ell +1$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n vertices is 0, 1,\n \n \n \n $\\ell$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , or\n \n \n \n $\\ell +1$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . We show that every disperse\n \n \n \n $\\ell$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -uniform hypergraph on\n \n \n \n $n$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n vertices contains a clique or independent set of size\n \n \n \n $n^{\\Omega _{\\ell }(1)}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , answering a question of the first author and Tomon. To this end, we prove several structural properties of disperse hypergraphs.\n <\/jats:p>","DOI":"10.1017\/s0963548325100205","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:27:48Z","timestamp":1761550068000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Disperse hypergraphs"],"prefix":"10.1017","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0688-8111","authenticated-orcid":false,"given":"Lior","family":"Gishboliner","sequence":"first","affiliation":[{"name":"University of Toronto"}]},{"given":"Ethan","family":"Honest","sequence":"additional","affiliation":[{"name":"University of Toronto"}]}],"member":"56","published-online":{"date-parts":[[2025,10,27]]},"reference":[{"key":"S0963548325100205_ref4","doi-asserted-by":"publisher","DOI":"10.1093\/imrn\/rnae065"},{"key":"S0963548325100205_ref2","unstructured":"2. Arnold, F. , Gishboliner, L. and Sudakov, B. (2024) Two Erd\u0151s\u2013Hajnal-type theorems for forbidden order-size pairs, arXiv preprint arXiv: 2406.04154."},{"key":"S0963548325100205_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.05.005"},{"key":"S0963548325100205_ref7","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.417"},{"key":"S0963548325100205_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20441"},{"key":"S0963548325100205_ref9","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579319000135"},{"key":"S0963548325100205_ref11","unstructured":"11. Nguyen, T. , Scott, A. and Seymour, P. (2023) Induced subgraph density VII The five-vertex path, arXiv preprint arXiv: 2312.15333."},{"key":"S0963548325100205_ref10","unstructured":"10. Nguyen, T. , Scott, A. and Seymour, P. (2023) Induced subgraph density. VI. Bounded VC-dimension, arXiv preprint arXiv: 2312.15572."},{"key":"S0963548325100205_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050117"},{"key":"S0963548325100205_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2020.03.001"},{"key":"S0963548325100205_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548323000433"},{"key":"S0963548325100205_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90045-0"},{"key":"S0963548325100205_ref8","doi-asserted-by":"publisher","DOI":"10.1112\/blms.12681"},{"key":"S0963548325100205_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90084-2"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548325100205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T08:49:24Z","timestamp":1768207764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548325100205\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,27]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["S0963548325100205"],"URL":"https:\/\/doi.org\/10.1017\/s0963548325100205","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,27]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}