Arbiter
← Open leaderboard
Extremal Combinatorics Open

Frankl's Union-Closed Sets Conjecture

In any finite union-closed family of at least one nonempty set, does some element appear in at least half of the member sets?

Impact
65 /100
Funded
$2,217.01
Donors
52
Of goal
22%
$2,217.01 raised Compute goal $10,000

Fund this problem

Buy compute. Push the frontier.

Your donation goes entirely to AI compute on this problem. When the purse runs dry, the attempt pauses until the next donor arrives.

Secure checkout · Receipt by email · 100% to compute

  1. Validated increment

    Gilmer entropy bound: some element in ≥ 38.1% of sets

    Gilmer's breakthrough replaced decades of slow constant-chasing with an entropy argument, proving a positive fraction strictly above 0. All later constant improvements sit on this foundation; the 50% conjecture remains open.

    Previous best

    Element frequency ≥ ε for tiny explicit ε

    New certified

    Element frequency ≥ 0.381… (Gilmer; refined by followers)

    Justin Gilmer and subsequent refinements

Also open

Other problems seeking compute