Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T19:43:52.896Z Has data issue: false hasContentIssue false
  • English
  • Français

A note of the union-closed sets conjecture

Part of: Combinatorics

Published online by Cambridge University Press:  09 April 2009

R. M. Norton  and
D. G. Sarvate
R. M. Norton
Affiliation:
College of Charleston, Charleston, SC 29424, USA
D. G. Sarvate
Affiliation:
College of Charleston, Charleston, SC 29424, USA
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 = {A1, …, An} be a union-closed set. This note establishes a property which must be possessed by any smallest counterexample to the Union-Closed Sets Conjecture. Specifically, a counterexample to the conjecture with minimal n has at least three distinct elements, each of which appears in exactly (n − 1)/2 of the .

MSC classification

Secondary: 05A99: None of the above, but in this section
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 55 , Issue 3 , December 1993 , pp. 411 - 413
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]‘A much travelled conjecture’, Austral. Math. Soc. Gaz. 14 (1987), 63.Google Scholar
[2](ed. Rival, I.), Graphs and Order, (proceedings of the NATO advanced study institute on graphs and order) (Reidel, Dordrecht, 1984).Google Scholar
[3]Sarvate, D. G. and Renaud, J.-C., ‘On the union-closed sets conjecture’, Ars, Combin. 27 (1989), 149–154.Google Scholar
[4]Sarvate, D. G. and Renaud, J.-C., ‘Improved bounds for the union-closed sets conjecture’, Ars Combin. 29 (1990), 181–185.Google Scholar
[5]Stanley, R. P., Enumerative Combinatorics (Wadsworth, Monterey, 1986).CrossRefGoogle Scholar
[6]Winkler, P., ‘Union-closed sets conjecture’, Austral. Math. Soc. Gaz. 14 (1987), 99.Google Scholar