Covering pairs by \(q^ 2+q+1\) sets

DOI10.1016/0097-3165(90)90034-TzbMath0734.05033OpenAlexW2401408883MaRDI QIDQ810520

Zoltan Fueredi

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(90)90034-t

zbMATH Keywords

hypergraphscovering pairsfractional matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items

Bundling equilibrium in combinatorial auctions, What we know and what we do not know about Turán numbers, On intersecting hypergraphs, Generalising Fisher's inequality to coverings and packings, Matchings and covers in hypergraphs, Regular intersecting families, Intersecting designs from linear programming and graphs of diameter two

Cites Work

• Lower bounds for coverings of pairs by large blocks
• On a packing and covering problem
• t-expansive and t-wise intersecting hypergraphs
• Finite projective spaces and intersecting hypergraphs
• On maximal intersecting families of finite sets
• Golden ratios in a pairs covering problem
• Maximum degree and fractional matchings in uniform hypergraphs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• On subplane partitions of a finite projective plane
• On the Fractional Covering Number of Hypergraphs
• Blocking Sets in Finite Projective Planes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item