On a Problem of Erdos and Lovasz. II: n(r) = O(r)

DOI10.2307/2152722zbMath0792.05080OpenAlexW4247733898MaRDI QIDQ4276533

Jeffry Kahn

Publication date: 24 July 1994

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152722

zbMATH Keywords

hypergraphlower boundproblem of Erdős and Lovász

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Fractional v. integral covers in hypergraphs of bounded edge size ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited ⋮ Game saturation of intersecting families ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Invitation to intersection problems for finite sets ⋮ Random constructions and density results

This page was built for publication: On a Problem of Erdos and Lovasz. II: n(r) = O(r)