{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:45:59Z","timestamp":1787323559070,"version":"build-2736575974"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","award":["G-1347-304.6\/20"],"award-info":[{"award-number":["G-1347-304.6\/20"]}],"id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["281\/17"],"award-info":[{"award-number":["281\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002336","name":"Simmons Family Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002336","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We prove that the minimum number of vertices of a hypergraph that contains every $d$-uniform hypergraph on $k$ vertices as an induced subhypergraph is $(1+o(1))2^{\\binom{k}{d}\/k}$. The proof relies on the probabilistic method and provides a nonconstructive solution. In addition we exhibit an explicit construction of a hypergraph on $\\Theta(2^{\\binom{k}{d}\/k})$ vertices, containing every $d$-uniform hypergraph on $k$ vertices as an induced subhypergraph.<\/jats:p>","DOI":"10.1137\/18m1163750","type":"journal-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:32:01Z","timestamp":1554816721000},"page":"629-642","source":"Crossref","is-referenced-by-count":1,"title":["Induced Universal Hypergraphs"],"prefix":"10.1137","volume":"33","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadav","family":"Sherman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"key":"atypb1","unstructured":"N. Alon and J. H. Spencer,\n                      The Probabilistic Method\n                      , 4th ed., Wiley, Hoboken, NJ, 2016."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-017-0396-9"},{"key":"atypb3","first-page":"1149","author":"Alon N.","year":"2017","journal-title":"Philadelphia"},{"key":"atypb4","first-page":"625","author":"Alstrup S.","year":"2015","journal-title":"New York"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(81)80015-7"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-009-0860-x"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140408"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.04.020"},{"key":"atypb9","first-page":"582","author":"Gavoille C.","year":"2007","journal-title":"Berlin"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"atypb11","first-page":"345","volume":"84","author":"Lozin V. V.","year":"2007","journal-title":"Ars Combin."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1017\/S2040618500035139"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"atypb14","unstructured":"N. Sherman,\n                      Induced Universal Hypergraphs\n                      , M.Sc. Thesis, Tel Aviv University, Tel Aviv, 2017."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1070\/RM1968v023n06ABEH001252"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1163750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:09:22Z","timestamp":1787321362000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1163750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1163750"],"URL":"https:\/\/doi.org\/10.1137\/18m1163750","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}