12 citations · 27 across the 15 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015★ 1 cited
Inside the clustering window for random linear equations
Pu Gao, Michael Molloy
We study a random system of cn linear equations over n variables in GF(2), where each equation contains exactly r variables; this is equivalent to r-XORSAT. Previous work has estab…
math.CO2015
The stripping process can be slow: part II
Pu Gao
This paper is a continuation of the previous results on the stripping number of a random uniform hypergraph, and the maximum depth over all non-k-core vertices. The previous result…
math.CO2015★ 6 cited
The stripping process can be slow: part I
Pu Gao, Mike Molloy
Given an integer k, we consider the parallel k-stripping process applied to a hypergraph H: removing all vertices with degree less than k in each iteration until reaching the k-cor…