The LCM-closed sets conjecture
The LCM-closed sets conjecture
Let be a finite LCM-closed set, meaning that whenever , and suppose that contains an element different from . A divisor larger than is called abundant if it divides at least half of the members of . The LCM-closed sets conjecture. There exists a divisor larger than for a subset of at least half of the members of . This conjecture is equivalent to Frankl's union-closed sets conjecture and has interpretations in graph and lattice theory; it remains open because Frankl's conjecture remains open.
Sources & referencesView supporting material
Primary source
Tom Fischer, “Share at least half the numbers in a nontrivial LCM-closed set a nontrivial divisor?”, arXiv:1808.09247 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.