Fractional set systems with few disjoint pairs

DOI10.1016/J.DISC.2009.08.003MaRDI QIDQ1045152zbMATH OpenOpenAlexFDO

Authors Joshua Brown Kramer

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.08.003

zbMATH Keywords

extremal problemshypergraphsintersecting familyfractional set systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Set systems with few disjoint pairs
• On families of weakly cross-intersecting set-pairs
• Fractional cross intersecting families
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• The minimum number of disjoint pairs in set systems and related problems

Cites work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• On the minimum number of disjoint pairs in a family of finite sets
• Set systems with few disjoint pairs
• Simple hypergraphs with maximal number of adjacent pairs of edges
• The complete intersection theorem for systems of finite sets

Cited in

(2)

• Set systems with few disjoint pairs
• Reflect-push methods. Part I: Two dimensional techniques

This page was built for publication: Fractional set systems with few disjoint pairs

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