Hostname: page-component-74656f9884-skzmx Total loading time: 0 Render date: 2026-11-06T08:09:16.384Z Has data issue: false hasContentIssue false
  • English
  • Français

An Average Set Size Theorem

Published online by Cambridge University Press:  28 January 2003

DAVID REIMER
DAVID REIMER
Affiliation:
Department of Mathematics, The College of New Jersey, Ewing, NJ 086280718, USA (e-mail: dreimer@tcnj.edu)
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.

In this paper we prove that, if a collection of sets [Ascr] is union-closed, then the average set size of $\cal A is at least $\frac{1}{2}\log_2 (\vert{\cal A}\vert)$.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 1 , January 2003 , pp. 89 - 93
Copyright
2003 Cambridge University Press