This article summarizes progress on several old hypergraph problems of Paul Erdős and a few questions to which they led. Quite unexpectedly, there turned out to be substantial connections between the problems under discussion, surely some indication (if any were needed) that Erdős’ questions were the “right” ones. Here’s a quick synopsis.
CITATION STYLE
Kahn, J. (2013). On some hypergraph problems of paul erdős and the asymptotics of matchings, covers and colorings. In The Mathematics of Paul Erdos I, Second Edition (pp. 343–369). Springer New York. https://doi.org/10.1007/978-1-4614-7258-2_22
Mendeley helps you to discover research relevant for your work.