@article{889630fe5573484484362f17c3eaa1a5,
title = "Induced universal hypergraphs",
abstract = "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 \Bigl(k d \Bigr) /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 \Bigl(k d \Bigr) /k) vertices, containing every d-uniform hypergraph on k vertices as an induced subhypergraph.",
keywords = "Hypergraph, Labeling, Universal",
author = "Noga Alon and Nadav Sherman",
note = "Publisher Copyright: \bigcirc c 2019 Society for Industrial and Applied Mathematics",
year = "2019",
doi = "10.1137/18M1163750",
language = "אנגלית",
volume = "33",
pages = "629--642",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics (SIAM)",
number = "2",
}