2 citations · 3 across the 2 of their papers we have counts for
3 papers
math.CO2016
Homological connectivity of random hypergraphs
Oliver Cooley, Penny Haxell, Mihyun Kang +1
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homol…
math.CO2009★ 1 cited
On the homology of locally finite graphs
Reinhard Diestel, Philipp Sprüssel
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characte…
math.CO2009★ 2 cited
On 3-coloured tournaments
Agelos Georgakopoulos, Philipp Sprüssel
We (re-)prove that in every 3-edge-coloured tournament in which no vertex is incident with all colours there is either a cyclic rainbow triangle or a vertex dominating every other…