2 citations · 3 across the 4 of their papers we have counts for
4 papers
The union-closed sets conjecture almost holds for almost all random bipartite graphs
Henning Bruhn, Oliver Schaudt
Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided ther…
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…
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.
Finite connectivity in infinite matroids
Henning Bruhn, Paul Wollan
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under dual…