Motivation for Frankl's conjecture? Frankl's conjecture, open since 1979, says that if $F$ is a union-closed family of subsets of $X$, then there is some $x \in X$ such that $x$ appears in at least half the sets in $F$.
What was the motivation for this conjecture? Is it a generalization of some simpler known fact? 
 A: As stated, there are a couple of counterexamples F.  There are no known counterexamples when X is in F and X is finite and nonempty.
I do not know of Peter Frankl's original motivation.  A 1990 paper of Bjorn Poonen "On the Union-Closed Sets Conjecture" has some suggestive examples, however.  Note that it holds when F is the powerset of a nonempty X, and also when F is "large enough" in the sense that the average set size of a set in F is at least half the size of X.  Also (as Dustin Mixon remarks), it is a very accessible and nontrivial statement, but not like Gauss said of Fermat's Last Theorem as being one of
 hundreds of statements in number theory of which he could neither readily prove nor dispose.
Gerhard "Ask Me About Frankl's Conjecture" Paseman, 2013.05.22
A: Frankl originally stated the dual of the problem as written here, i.e., in terms of intersections instead of unions.  This seems to have been in the 1979 edition of the Handbook of Combinatorics [edit: No such edition exists, and I'm not sure of the original source.  See comments below], which isn't that easy to find, but the current edition is up on Google Books, and he states it in this form at the beginning of his (updated) chapter on Extremal Set Systems as Conjecture 2.1:  For an intersection-closed family of subsets of $[n]$, there is an element that is contained in at most half the subsets.
I always assumed that the conjecture was following in the spirit of Erdos-Ko-Rado type theorems.  Let me expand below:
The Erdos-Ko-Rado Theorem bounds the size of a family of small sets $\mathcal{F}$ with pairwise nonempty intersection (see erdos-ko-rado for details).  An extension of this due to Hilton-Milner says that a maximum-size family of small subsets of $[n]$ with pairwise nonempty intersection has an element contained in all of the subsets. 
In the intersection-closed family $\mathcal{G}$ taken by considering all intersections of sets from $\mathcal{F}$ (satisfying the Erdos-Ko-Rado/Hilton-Milner conditions), this says that there is an element contained in all subsets from $\mathcal{G}$.  If one makes it this far, it's reasonable to ask how few a number of subsets an element may be contained in, which is exactly what Frankl's Conjecture concerns.
UPDATE MAY 2016:  I've had cause to look into the provenance more.  Apparently Frankl asked the question in '79, and talked about it with several people, but never published it.  The first appearance in print arises from a problem session at the 1984 conference on Graphs and Order in Banff, where Duffus presented several forms of the problem.  The conference proceedings are in the volume "Graphs and order".  From the summary there, Duffus appears to have already known several partial results on the conjecture that were only published much later.
See also the recent survey article of Bruhn and Schaudt.
