Daniel J. Poole

most citedOn Weak Hamiltonicity of a Random Hypergraph

11 citations · 11 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2014★ 11 cited

On Weak Hamiltonicity of a Random Hypergraph

Daniel Poole

A {\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges $C = (v_{0}, e_{1}, v_{1}, ..., v_{ℓ - 1}, e_{ℓ}, v_{ℓ} = v_{0})$ such that the vertices $v_0, ..., v_{\…

math.CO2014

On the strength of connectedness of a random hypergraph

Daniel Poole

Bollobás and Thomason (1985) proved that for each $k = k (n) \in [1, n - 1]$ , with high probability, the random graph process, where edges are added to vertex set $V = [n]$ uniformly at r…