The 6-element case of S-Frankl conjecture (I)
Abstract
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in the family. In [3], a stronger version of Frankl's conjecture (S-Frankl conjecture for short) was introduced and a partial proof was given. In particular, it was proved in CH17 that S-Frankl conjecture holds when n≤ 5, where n is the number of all the elements in the family of sets. Now, we want to prove that it holds when n=6. Since the paper is very long, we split it into two parts. This is the first part.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.