A finite set covering theorem

DOI10.1017/S0004972700047067MaRDI QIDQ5618373zbMATH OpenOpenAlexFDO

Authors Alan Brace, David E. Daykin

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited in

(22)

• t-expansive and t-wise intersecting hypergraphs
• Multiply-intersecting families
• The minimal number of basic elements in a multiset antichain
• The edge-coloring of complete hypergraphs. I
• Matchings and covers in hypergraphs
• Application of hypergraph Hoffman's bound to intersecting families
• Non-trivial \(d\)-wise intersecting families
• Multiply-intersecting families revisited
• Some exact results for multiply intersecting families
• Brace-Daykin type inequalities for intersecting families
• Non-trivial 3-wise intersecting uniform families
• An extension of the Erdős–Ko–Rado Theorem
• Regularity Conditions and Intersecting Hypergraphs
• Sets of finite sets satisfying union conditions
• The maximum measure of non-trivial 3-wise intersecting families
• Non-trivial r-wise intersecting families
• The maximum size of intersecting and union families of sets
• Short proofs of three results about intersecting systems
• Non-trivial r-wise agreeing families
• Invitation to intersection problems for finite sets
• Separation with restricted families of sets
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case

This page was built for publication: A finite set covering theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5618373)