Find set configurations that imply FUNC: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
Tomtom2357 (talk | contribs) Created page with "== Introduction == One of the first observations on the conjecture is that if a union closed family contains a singleton set {x}, then the set <math>\mathcal{A}_x = \{A \in \..." |
Tomtom2357 (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
== Introduction == | == Introduction == | ||
One of the first observations on the conjecture is that if a union closed family contains a singleton set {x}, then the set <math>\mathcal{A}_x = \{A \in \mathcal{A} : x \in A\}</math>, contains at least as many sets as <math>\mathcal{A}_x = \{A \in \mathcal{A} : x \ | One of the first observations on the conjecture is that if a union closed family contains a singleton set {x}, then the set <math>\mathcal{A}_x = \{A \in \mathcal{A} : x \in A\}</math>, contains at least as many sets as <math>\mathcal{A}_x = \{A \in \mathcal{A} : x \notin A\}</math> | ||
Revision as of 06:00, 9 February 2016
Introduction
One of the first observations on the conjecture is that if a union closed family contains a singleton set {x}, then the set [math]\displaystyle{ \mathcal{A}_x = \{A \in \mathcal{A} : x \in A\} }[/math], contains at least as many sets as [math]\displaystyle{ \mathcal{A}_x = \{A \in \mathcal{A} : x \notin A\} }[/math]
