Gao Pu

activity

20102026

most citedAnalysis of the parallel peeling algorithm: a short proof

8 citations · 39 across the 17 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs

Pu Gao, Reshma Ramadurai, Ian M. Wanless +1

A graph $G$ whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching $M$ that contains exactly one edge of each colour. We refute…

math.CO2017

The satisfiability threshold for random linear equations

Peter Ayre, Amin Coja-Oghlan, Pu Gao +1

Let $A$ be a random $m \times n$ matrix over the finite field $F_{q}$ with precisely $k$ non-zero entries per row and let $y \in F_{q}^{m}$ be a random vector chosen independently of $A$ .…

math.CO2017★ 7 cited

Full rainbow matchings in graphs and hypergraphs

Pu Gao, Reshma Ramadurai, Ian Wanless +1

Let $G$ be a simple graph that is properly edge coloured with $m$ colours and let $\M=\{M_1,\ldots, M_m\}$ be the set of $m$ matchings induced by the colours in $G$ . Suppose that $…