On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings

Jeff Kahn ()
Additional contact information
Jeff Kahn: Rutgers University, Department of Mathematics and RUTCOR

A chapter in The Mathematics of Paul Erdős I, 2013, pp 343-369 from Springer

Abstract: Abstract 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.

Keywords: Hypergraph; List Chromatic Index; Edge Cover Number; Semirandom; List Coloring (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_22

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().