|
СЕМИНАРЫ |
Математический кружок школы ПМИ МФТИ
|
|||
|
Maximal cliques and nearly disjoint hypergraphs Z. Furedi Department of Mathematics, Illinois State University |
|||
Аннотация: Short abstract. 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. |