activity
20062026
most citedFast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

6 citations · 27 across the 25 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

math.CO2012

The graph formulation of the union-closed sets conjecture

Henning Bruhn, Pierre Charbit, Oliver Schaudt +1

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equi…