@article{193f6d28054e48f39ee9795a71518775,
title = "On an extremal hypergraph problem of brown, Erdos and S{\'o}s",
abstract = "Let f r (n,v,e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain e edges spanned by v vertices. Extending previous results of Ruzsa and Szemer{\'e}di and of Erdos, Frankl and R{\"o}dl, we partially resolve a problem raised by Brown, Erdos and S{\'o}s in 1973, by showing that for any fixed 2≤kk-o(1) < fr (n, 3(r - k) + k + 1, 3) = o(n k).",
keywords = "05C65, 05D99",
author = "Noga Alon and Asaf Shapira",
note = "Funding Information: * Research supported in part by a USA-Israeli BSF grant, by th e Israel Science Foundation and by th e Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. † Th is work forms part of th e auth or{\textquoteright}s Ph .D. Th esis. Research supported by a Ch arles Clore Foundation Fellowsh ip and an IBM Ph .D. Fellowsh ip.",
year = "2006",
month = dec,
doi = "10.1007/s00493-006-0035-9",
language = "אנגלית",
volume = "26",
pages = "627--645",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "6",
}