Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T19:51:39.993Z Has data issue: false hasContentIssue false

A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

Part of:Graph theory

Published online by Cambridge University Press:  04 June 2019

Peter Frankl*
Affiliation:
Alfred Rényi Institute of Mathematics, Hungarian Academy of Sciences, H-1053 Budapest, Retanoda u. 13-15, Hungary
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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) ≤ kk. For k ≥ 625 we prove m(k) < kk・e−k1/4/6.

MSC classification

Information

Type
Paper
Copyright
© Cambridge University Press 2019