2000 character limit reached
On the lattice formulation of the union-closed sets conjecture
Published 1 Mar 2025 in math.CO | (2503.00277v1)
Abstract: The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice with more than one element contains a join-irreducible element that is less than or equal to at most half of the elements in . In this work, we obtain several necessary conditions for any counterexample of minimum size.
Paper Prompts
Sign up for free to create and run prompts on this paper.