
Abstract
Erdos and Lovasz had a number of generalizations and problems concerning Property B.
Here we overview some related classical and new results. A sample example: Two hypergraphs H_1 and H_2 are called ’nearly disjoint’ if every edge of H_1 meets every edge of H_2 in at most one vertex. Sharpening some results of Krivelevich (with coauthors Kumbhat and Kostochka) we show that (for appropriate k and q) there are q pairwise nearly disjoint k-uniform hypergraphs H_1, …, H_q.
Here we overview some related classical and new results. A sample example: Two hypergraphs H_1 and H_2 are called ’nearly disjoint’ if every edge of H_1 meets every edge of H_2 in at most one vertex. Sharpening some results of Krivelevich (with coauthors Kumbhat and Kostochka) we show that (for appropriate k and q) there are q pairwise nearly disjoint k-uniform hypergraphs H_1, …, H_q.
За расписанием мероприятий, которые проводит ФПМИ, можно следить по ссылке.