Tag Archives: Justin Gilmer

Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture

Frankl’s conjecture (aka the union closed sets conjecture) asserts that if is a family of subsets of [n] (=: ) which is closed under union then there is an element such that Justin Gilmer just proved an amazing weaker form … Continue reading

Posted in Combinatorics, Open problems | Tagged , , | 22 Comments