A finite set covering theorem
From MaRDI portal
Publication:5618373
DOI10.1017/S0004972700047067zbMath0215.33001OpenAlexW4248210384MaRDI QIDQ5618373
Publication date: 1971
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700047067
Related Items
t-expansive and t-wise intersecting hypergraphs, Multiply-intersecting families revisited, Application of hypergraph Hoffman's bound to intersecting families, Some exact results for multiply intersecting families, The maximum measure of non-trivial 3-wise intersecting families, Non-trivial \(r\)-wise intersecting families, Regularity Conditions and Intersecting Hypergraphs, Non-trivial 3-wise intersecting uniform families, Non-trivial \(d\)-wise intersecting families, The maximum size of intersecting and union families of sets, Brace-Daykin type inequalities for intersecting families, Multiply-intersecting families, A multiply intersecting Erdős-Ko-Rado theorem -- the principal case, The minimal number of basic elements in a multiset antichain, Invitation to intersection problems for finite sets, Separation with restricted families of sets, The edge-coloring of complete hypergraphs. I, Matchings and covers in hypergraphs, An extension of the Erdős–Ko–Rado Theorem, Sets of finite sets satisfying union conditions
