19 citations · 41 across the 26 of their papers we have counts for
Showing 2012Show all
3 papers · 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…
math.CO2012★ 2 cited
Matroid and Tutte-connectivity in infinite graphs
Henning Bruhn
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which a…
math.CO2012
Minimal bricks have many vertices of small degree
Henning Bruhn, Maya Stein
We prove that every minimal brick on n vertices has at least n/9 vertices of degree at most 4.