A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. (4th September 2019)
- Record Type:
- Journal Article
- Title:
- A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. (4th September 2019)
- Main Title:
- A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
- Authors:
- Frankl, Peter
- Abstract:
- Abstract: Let m ( k ) denote the maximum number of edges in a non-extendable, intersecting k -graph. Erdős and Lovász proved that m ( k ) ≤ k k . For k ≥ 625 we prove m ( k ) < k k ・ e − k 1 / 4 / 6 .
- Is Part Of:
- Combinatorics, probability and computing. Volume 28:Number 5(2019)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 28:Number 5(2019)
- Issue Display:
- Volume 28, Issue 5 (2019)
- Year:
- 2019
- Volume:
- 28
- Issue:
- 5
- Issue Sort Value:
- 2019-0028-0005-0000
- Page Start:
- 733
- Page End:
- 739
- Publication Date:
- 2019-09-04
- Subjects:
- Primary 05C65, -- Secondary 05C35
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548319000142 ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 15563.xml