16 citations · 16 across the 1 of their papers we have counts for
1 paper
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus
For a hypergraph H=(V,E), its d--fold symmetric product is ΔdH=(Vd,{Ed∣E∈E}). We give several upper and lower bound…