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

DOI10.2307/2152722MaRDI QIDQ4276533zbMATH OpenOpenAlexFDO

Authors J. 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

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

Recommendations

• scientific article; zbMATH DE number 866666
• On an extremal hypergraph problem of Brown, Erdős and Sós
• On a problem of Erdős and Moser
• A note on intersecting hypergraphs with large cover number
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

Cited in

(12)

• Random constructions and density results
• On a problem of Erdős and Lovász: Random lines in a projective plane
• Fractional v. integral covers in hypergraphs of bounded edge size
• Game saturation of intersecting families
• scientific article; zbMATH DE number 866666 (Why is no real title available?)
• Multipartite hypergraphs achieving equality in Ryser's conjecture
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited
• The intersection spectrum of 3-chromatic intersecting hypergraphs
• On the size of maximal intersecting families
• The power of many colours
• Invitation to intersection problems for finite sets

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

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